/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:27:30,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:27:30,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:27:30,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:27:30,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:27:30,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:27:30,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:27:30,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:27:30,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:27:30,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:27:30,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:27:30,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:27:30,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:27:30,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:27:30,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:27:30,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:27:30,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:27:30,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:27:30,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:27:30,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:27:30,280 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:27:30,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:27:30,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:27:30,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:27:30,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:27:30,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:27:30,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:27:30,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:27:30,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:27:30,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:27:30,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:27:30,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:27:30,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:27:30,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:27:30,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:27:30,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:27:30,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:27:30,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:27:30,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:27:30,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:27:30,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:27:30,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:27:30,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:27:30,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:27:30,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:27:30,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:27:30,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:27:30,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:27:30,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:27:30,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:27:30,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:27:30,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:27:30,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:27:30,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:27:30,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:27:30,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:27:30,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:27:30,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:27:30,307 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:27:30,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:27:30,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:27:30,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 11:27:30,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:27:30,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:27:30,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:27:30,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:27:30,477 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:27:30,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2022-04-27 11:27:30,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d399d0c3/47cd5871ceda439c8d4a02c4133977b3/FLAGd2852d6dc [2022-04-27 11:27:30,843 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:27:30,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-2.c [2022-04-27 11:27:30,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d399d0c3/47cd5871ceda439c8d4a02c4133977b3/FLAGd2852d6dc [2022-04-27 11:27:30,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d399d0c3/47cd5871ceda439c8d4a02c4133977b3 [2022-04-27 11:27:30,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:27:30,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:27:30,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:27:30,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:27:30,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:27:30,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:27:30" (1/1) ... [2022-04-27 11:27:30,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5a556f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:30, skipping insertion in model container [2022-04-27 11:27:30,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:27:30" (1/1) ... [2022-04-27 11:27:30,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:27:30,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:27:31,025 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/nested5-2.c[321,334] [2022-04-27 11:27:31,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:27:31,052 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:27:31,063 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/nested5-2.c[321,334] [2022-04-27 11:27:31,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:27:31,087 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:27:31,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31 WrapperNode [2022-04-27 11:27:31,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:27:31,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:27:31,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:27:31,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:27:31,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:27:31,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:27:31,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:27:31,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:27:31,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (1/1) ... [2022-04-27 11:27:31,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:27:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:31,142 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-27 11:27:31,150 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-27 11:27:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:27:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:27:31,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:27:31,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:27:31,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:27:31,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:27:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:27:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:27:31,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:27:31,229 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:27:31,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:27:31,347 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:27:31,352 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:27:31,352 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 11:27:31,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:27:31 BoogieIcfgContainer [2022-04-27 11:27:31,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:27:31,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:27:31,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:27:31,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:27:31,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:27:30" (1/3) ... [2022-04-27 11:27:31,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381ab3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:27:31, skipping insertion in model container [2022-04-27 11:27:31,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:27:31" (2/3) ... [2022-04-27 11:27:31,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381ab3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:27:31, skipping insertion in model container [2022-04-27 11:27:31,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:27:31" (3/3) ... [2022-04-27 11:27:31,358 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-2.c [2022-04-27 11:27:31,366 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:27:31,367 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:27:31,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:27:31,429 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@377c9f2d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6267e90 [2022-04-27 11:27:31,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:27:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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-27 11:27:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:27:31,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:31,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:31,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2022-04-27 11:27:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274364199] [2022-04-27 11:27:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:31,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:31,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 11:27:31,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 11:27:31,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-27 11:27:31,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:31,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-27 11:27:31,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 11:27:31,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-27 11:27:31,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-27 11:27:31,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {31#true} is VALID [2022-04-27 11:27:31,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {31#true} is VALID [2022-04-27 11:27:31,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {31#true} is VALID [2022-04-27 11:27:31,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {31#true} is VALID [2022-04-27 11:27:31,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {31#true} is VALID [2022-04-27 11:27:31,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-27 11:27:31,645 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-04-27 11:27:31,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-27 11:27:31,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-27 11:27:31,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 11:27:31,646 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-27 11:27:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:31,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274364199] [2022-04-27 11:27:31,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274364199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:27:31,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:27:31,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:27:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446985796] [2022-04-27 11:27:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:27:31,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:27:31,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:31,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:31,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:31,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:27:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:31,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:27:31,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:27:31,697 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:31,777 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-27 11:27:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:27:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:27:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-27 11:27:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-27 11:27:31,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-27 11:27:31,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:31,882 INFO L225 Difference]: With dead ends: 50 [2022-04-27 11:27:31,883 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:27:31,885 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-27 11:27:31,889 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 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-27 11:27:31,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:27:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:27:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 11:27:31,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:31,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:31,917 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:31,918 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:31,922 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 11:27:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 11:27:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:31,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:31,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 11:27:31,924 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 11:27:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:31,927 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 11:27:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 11:27:31,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:31,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:31,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:31,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-27 11:27:31,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-27 11:27:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:31,932 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-27 11:27:31,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 11:27:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:27:31,936 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:31,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:31,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:27:31,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2022-04-27 11:27:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:31,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968105827] [2022-04-27 11:27:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:31,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:32,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {187#true} is VALID [2022-04-27 11:27:32,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#true} assume true; {187#true} is VALID [2022-04-27 11:27:32,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187#true} {187#true} #85#return; {187#true} is VALID [2022-04-27 11:27:32,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {187#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:32,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {187#true} is VALID [2022-04-27 11:27:32,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#true} assume true; {187#true} is VALID [2022-04-27 11:27:32,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#true} {187#true} #85#return; {187#true} is VALID [2022-04-27 11:27:32,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {187#true} call #t~ret9 := main(); {187#true} is VALID [2022-04-27 11:27:32,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {187#true} is VALID [2022-04-27 11:27:32,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {187#true} is VALID [2022-04-27 11:27:32,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {187#true} is VALID [2022-04-27 11:27:32,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {187#true} is VALID [2022-04-27 11:27:32,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {187#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {192#(= main_~v~0 0)} is VALID [2022-04-27 11:27:32,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {192#(= main_~v~0 0)} assume !(~v~0 % 4294967296 < 268435455); {188#false} is VALID [2022-04-27 11:27:32,076 INFO L272 TraceCheckUtils]: 11: Hoare triple {188#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {188#false} is VALID [2022-04-27 11:27:32,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {188#false} ~cond := #in~cond; {188#false} is VALID [2022-04-27 11:27:32,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {188#false} assume 0 == ~cond; {188#false} is VALID [2022-04-27 11:27:32,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {188#false} assume !false; {188#false} is VALID [2022-04-27 11:27:32,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-27 11:27:32,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:32,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968105827] [2022-04-27 11:27:32,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968105827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:27:32,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:27:32,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:27:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443694856] [2022-04-27 11:27:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:27:32,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:27:32,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:32,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:32,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:27:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:27:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:27:32,092 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:32,191 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-27 11:27:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:27:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:27:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 11:27:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 11:27:32,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-27 11:27:32,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:32,239 INFO L225 Difference]: With dead ends: 49 [2022-04-27 11:27:32,240 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 11:27:32,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-27 11:27:32,241 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:32,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:27:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 11:27:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-27 11:27:32,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:32,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,245 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,245 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:32,247 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 11:27:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 11:27:32,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:32,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:32,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 11:27:32,248 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 11:27:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:32,249 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 11:27:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 11:27:32,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:32,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:32,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:32,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 11:27:32,251 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-04-27 11:27:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:32,251 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 11:27:32,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 11:27:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:27:32,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:32,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:32,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:27:32,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:32,253 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2022-04-27 11:27:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:32,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840703731] [2022-04-27 11:27:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:32,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-27 11:27:32,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-27 11:27:32,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #85#return; {371#true} is VALID [2022-04-27 11:27:32,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:32,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-27 11:27:32,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-27 11:27:32,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #85#return; {371#true} is VALID [2022-04-27 11:27:32,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret9 := main(); {371#true} is VALID [2022-04-27 11:27:32,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {376#(= main_~v~0 0)} is VALID [2022-04-27 11:27:32,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {376#(= main_~v~0 0)} is VALID [2022-04-27 11:27:32,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {377#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:27:32,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} assume !(~v~0 % 4294967296 < 268435455); {372#false} is VALID [2022-04-27 11:27:32,362 INFO L272 TraceCheckUtils]: 13: Hoare triple {372#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {372#false} is VALID [2022-04-27 11:27:32,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {372#false} ~cond := #in~cond; {372#false} is VALID [2022-04-27 11:27:32,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} assume 0 == ~cond; {372#false} is VALID [2022-04-27 11:27:32,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-27 11:27:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:32,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840703731] [2022-04-27 11:27:32,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840703731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:32,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889465368] [2022-04-27 11:27:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:32,368 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-27 11:27:32,369 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-27 11:27:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:32,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:27:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:32,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:32,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2022-04-27 11:27:32,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-27 11:27:32,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-27 11:27:32,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #85#return; {371#true} is VALID [2022-04-27 11:27:32,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret9 := main(); {371#true} is VALID [2022-04-27 11:27:32,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {376#(= main_~v~0 0)} is VALID [2022-04-27 11:27:32,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {376#(= main_~v~0 0)} is VALID [2022-04-27 11:27:32,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {415#(= main_~v~0 1)} is VALID [2022-04-27 11:27:32,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#(= main_~v~0 1)} assume !(~v~0 % 4294967296 < 268435455); {372#false} is VALID [2022-04-27 11:27:32,470 INFO L272 TraceCheckUtils]: 13: Hoare triple {372#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {372#false} is VALID [2022-04-27 11:27:32,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {372#false} ~cond := #in~cond; {372#false} is VALID [2022-04-27 11:27:32,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} assume 0 == ~cond; {372#false} is VALID [2022-04-27 11:27:32,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-27 11:27:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:32,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:32,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-27 11:27:32,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} assume 0 == ~cond; {372#false} is VALID [2022-04-27 11:27:32,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {372#false} ~cond := #in~cond; {372#false} is VALID [2022-04-27 11:27:32,531 INFO L272 TraceCheckUtils]: 13: Hoare triple {372#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {372#false} is VALID [2022-04-27 11:27:32,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#(< (mod main_~v~0 4294967296) 268435455)} assume !(~v~0 % 4294967296 < 268435455); {372#false} is VALID [2022-04-27 11:27:32,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {447#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {443#(< (mod main_~v~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:32,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {447#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {447#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:32,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {447#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:32,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {371#true} is VALID [2022-04-27 11:27:32,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret9 := main(); {371#true} is VALID [2022-04-27 11:27:32,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #85#return; {371#true} is VALID [2022-04-27 11:27:32,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-27 11:27:32,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {371#true} is VALID [2022-04-27 11:27:32,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2022-04-27 11:27:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:32,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889465368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:32,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:32,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 11:27:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95637896] [2022-04-27 11:27:32,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:27:32,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:32,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,568 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-27 11:27:32,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:27:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:27:32,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:27:32,569 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:32,833 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 11:27:32,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:27:32,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:27:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 11:27:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 11:27:32,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-27 11:27:32,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:32,888 INFO L225 Difference]: With dead ends: 55 [2022-04-27 11:27:32,888 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 11:27:32,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:27:32,892 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:32,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 41 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:27:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 11:27:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-27 11:27:32,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:32,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,908 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,909 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:32,912 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 11:27:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 11:27:32,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:32,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:32,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 11:27:32,914 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 11:27:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:32,919 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 11:27:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 11:27:32,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:32,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:32,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:32,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-27 11:27:32,923 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2022-04-27 11:27:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:32,923 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-27 11:27:32,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-27 11:27:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:27:32,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:32,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:32,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:27:33,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:33,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1312242250, now seen corresponding path program 2 times [2022-04-27 11:27:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:33,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003710394] [2022-04-27 11:27:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:33,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:33,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {693#true} is VALID [2022-04-27 11:27:33,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} assume true; {693#true} is VALID [2022-04-27 11:27:33,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693#true} {693#true} #85#return; {693#true} is VALID [2022-04-27 11:27:33,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:33,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {693#true} is VALID [2022-04-27 11:27:33,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} assume true; {693#true} is VALID [2022-04-27 11:27:33,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} #85#return; {693#true} is VALID [2022-04-27 11:27:33,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} call #t~ret9 := main(); {693#true} is VALID [2022-04-27 11:27:33,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {698#(= main_~v~0 0)} is VALID [2022-04-27 11:27:33,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {698#(= main_~v~0 0)} is VALID [2022-04-27 11:27:33,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:33,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:33,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:33,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:33,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:33,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:33,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {702#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:27:33,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} assume !(~v~0 % 4294967296 < 268435455); {694#false} is VALID [2022-04-27 11:27:33,275 INFO L272 TraceCheckUtils]: 19: Hoare triple {694#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 11:27:33,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 11:27:33,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 11:27:33,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 11:27:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:33,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:33,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003710394] [2022-04-27 11:27:33,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003710394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:33,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134767109] [2022-04-27 11:27:33,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:27:33,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:33,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:33,284 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-27 11:27:33,285 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-27 11:27:33,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:27:33,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:27:33,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:27:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:33,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:33,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 11:27:33,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {693#true} is VALID [2022-04-27 11:27:33,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} assume true; {693#true} is VALID [2022-04-27 11:27:33,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} #85#return; {693#true} is VALID [2022-04-27 11:27:33,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} call #t~ret9 := main(); {693#true} is VALID [2022-04-27 11:27:33,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {698#(= main_~v~0 0)} is VALID [2022-04-27 11:27:33,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {698#(= main_~v~0 0)} is VALID [2022-04-27 11:27:33,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:33,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:33,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:33,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:33,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {700#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:33,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:33,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {701#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {758#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:33,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {758#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !(~v~0 % 4294967296 < 268435455); {694#false} is VALID [2022-04-27 11:27:33,603 INFO L272 TraceCheckUtils]: 19: Hoare triple {694#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 11:27:33,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 11:27:33,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 11:27:33,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 11:27:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:33,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:33,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 11:27:33,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 11:27:33,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 11:27:33,730 INFO L272 TraceCheckUtils]: 19: Hoare triple {694#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 11:27:33,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {786#(< (mod main_~v~0 4294967296) 268435455)} assume !(~v~0 % 4294967296 < 268435455); {694#false} is VALID [2022-04-27 11:27:33,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {786#(< (mod main_~v~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {790#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {797#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {790#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {797#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {797#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {804#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {797#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {804#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {804#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {811#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {804#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {811#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {811#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {693#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {811#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:33,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {693#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {693#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {693#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {693#true} is VALID [2022-04-27 11:27:33,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {693#true} call #t~ret9 := main(); {693#true} is VALID [2022-04-27 11:27:33,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {693#true} {693#true} #85#return; {693#true} is VALID [2022-04-27 11:27:33,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {693#true} assume true; {693#true} is VALID [2022-04-27 11:27:33,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {693#true} is VALID [2022-04-27 11:27:33,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 11:27:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:33,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134767109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:33,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:33,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 11:27:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643245266] [2022-04-27 11:27:33,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:33,739 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:27:33,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:33,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:33,769 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-27 11:27:33,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:27:33,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:27:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:27:33,770 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:34,479 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-04-27 11:27:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:27:34,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:27:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2022-04-27 11:27:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2022-04-27 11:27:34,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 83 transitions. [2022-04-27 11:27:34,549 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-27 11:27:34,549 INFO L225 Difference]: With dead ends: 73 [2022-04-27 11:27:34,549 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 11:27:34,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:27:34,550 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:34,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 56 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:27:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 11:27:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-04-27 11:27:34,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:34,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:34,567 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:34,567 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:34,568 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 11:27:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-27 11:27:34,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:34,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:34,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-27 11:27:34,569 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-27 11:27:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:34,570 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 11:27:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-27 11:27:34,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:34,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:34,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:34,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 11:27:34,572 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-04-27 11:27:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:34,572 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 11:27:34,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 11:27:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:27:34,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:34,573 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:34,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:27:34,791 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,SelfDestructingSolverStorable3 [2022-04-27 11:27:34,791 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash -759453590, now seen corresponding path program 3 times [2022-04-27 11:27:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:34,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487792540] [2022-04-27 11:27:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:35,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {1154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1138#true} is VALID [2022-04-27 11:27:35,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} assume true; {1138#true} is VALID [2022-04-27 11:27:35,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1138#true} {1138#true} #85#return; {1138#true} is VALID [2022-04-27 11:27:35,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {1138#true} call ULTIMATE.init(); {1154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:35,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {1154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1138#true} is VALID [2022-04-27 11:27:35,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} assume true; {1138#true} is VALID [2022-04-27 11:27:35,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1138#true} #85#return; {1138#true} is VALID [2022-04-27 11:27:35,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1138#true} call #t~ret9 := main(); {1138#true} is VALID [2022-04-27 11:27:35,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {1138#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1143#(= main_~v~0 0)} is VALID [2022-04-27 11:27:35,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {1143#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {1143#(= main_~v~0 0)} is VALID [2022-04-27 11:27:35,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1143#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:35,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:35,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:35,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:35,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:35,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:35,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:35,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:35,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:35,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:35,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:35,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} assume !!(~v~0 % 4294967296 < 268435455); {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:35,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:35,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:35,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:35,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:35,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:35,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} assume !!(~v~0 % 4294967296 < 268435455); {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:35,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1153#(and (<= main_~v~0 10) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:27:35,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#(and (<= main_~v~0 10) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} assume !(~v~0 % 4294967296 < 268435455); {1139#false} is VALID [2022-04-27 11:27:35,028 INFO L272 TraceCheckUtils]: 31: Hoare triple {1139#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1139#false} is VALID [2022-04-27 11:27:35,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {1139#false} ~cond := #in~cond; {1139#false} is VALID [2022-04-27 11:27:35,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {1139#false} assume 0 == ~cond; {1139#false} is VALID [2022-04-27 11:27:35,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2022-04-27 11:27:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:35,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:35,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487792540] [2022-04-27 11:27:35,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487792540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:35,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869459539] [2022-04-27 11:27:35,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:27:35,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:35,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:35,030 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-27 11:27:35,032 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-27 11:27:35,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 11:27:35,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:27:35,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:27:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:35,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:35,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {1138#true} call ULTIMATE.init(); {1138#true} is VALID [2022-04-27 11:27:35,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1138#true} is VALID [2022-04-27 11:27:35,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} assume true; {1138#true} is VALID [2022-04-27 11:27:35,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1138#true} #85#return; {1138#true} is VALID [2022-04-27 11:27:35,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {1138#true} call #t~ret9 := main(); {1138#true} is VALID [2022-04-27 11:27:35,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1138#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1143#(= main_~v~0 0)} is VALID [2022-04-27 11:27:35,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {1143#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {1143#(= main_~v~0 0)} is VALID [2022-04-27 11:27:35,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {1143#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:35,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:35,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1144#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:35,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:35,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {1145#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:35,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:35,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {1146#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:35,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:35,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:35,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:35,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(and (<= main_~v~0 5) (<= 5 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:35,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} assume !!(~v~0 % 4294967296 < 268435455); {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:35,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {1149#(and (<= 6 main_~v~0) (<= main_~v~0 6))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:35,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:35,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#(and (<= main_~v~0 7) (<= 7 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:35,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:35,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#(and (<= main_~v~0 8) (<= 8 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:35,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} assume !!(~v~0 % 4294967296 < 268435455); {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:35,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {1152#(and (<= 9 main_~v~0) (<= main_~v~0 9))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1245#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:27:35,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {1245#(and (<= 10 main_~v~0) (<= main_~v~0 10))} assume !(~v~0 % 4294967296 < 268435455); {1139#false} is VALID [2022-04-27 11:27:35,375 INFO L272 TraceCheckUtils]: 31: Hoare triple {1139#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1139#false} is VALID [2022-04-27 11:27:35,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {1139#false} ~cond := #in~cond; {1139#false} is VALID [2022-04-27 11:27:35,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {1139#false} assume 0 == ~cond; {1139#false} is VALID [2022-04-27 11:27:35,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2022-04-27 11:27:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:35,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:35,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2022-04-27 11:27:35,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {1139#false} assume 0 == ~cond; {1139#false} is VALID [2022-04-27 11:27:35,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {1139#false} ~cond := #in~cond; {1139#false} is VALID [2022-04-27 11:27:35,724 INFO L272 TraceCheckUtils]: 31: Hoare triple {1139#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1139#false} is VALID [2022-04-27 11:27:35,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {1273#(< (mod main_~v~0 4294967296) 268435455)} assume !(~v~0 % 4294967296 < 268435455); {1139#false} is VALID [2022-04-27 11:27:35,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {1277#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1273#(< (mod main_~v~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {1277#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1277#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {1284#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1277#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {1284#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1284#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {1291#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1284#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {1291#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1291#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {1298#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1291#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {1298#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1298#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {1305#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1298#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {1305#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1305#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {1312#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1305#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {1312#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1312#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {1319#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1312#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1319#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1319#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {1326#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1319#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {1326#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1326#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {1333#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1326#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {1333#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1333#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1333#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1340#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {1340#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1340#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:27:35,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {1138#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {1138#true} call #t~ret9 := main(); {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1138#true} #85#return; {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} assume true; {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {1138#true} call ULTIMATE.init(); {1138#true} is VALID [2022-04-27 11:27:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:35,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869459539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:35,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:35,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 11:27:35,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183473780] [2022-04-27 11:27:35,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:35,742 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:27:35,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:35,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:35,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:27:35,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 11:27:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:35,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 11:27:35,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:27:35,784 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:40,102 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-27 11:27:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 11:27:40,103 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:27:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:27:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 113 transitions. [2022-04-27 11:27:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 113 transitions. [2022-04-27 11:27:40,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 113 transitions. [2022-04-27 11:27:40,213 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-27 11:27:40,214 INFO L225 Difference]: With dead ends: 109 [2022-04-27 11:27:40,214 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 11:27:40,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 11:27:40,215 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 110 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:27:40,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 96 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:27:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 11:27:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-04-27 11:27:40,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:27:40,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:40,243 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:40,243 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:40,245 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-27 11:27:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-27 11:27:40,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:40,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:40,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 73 states. [2022-04-27 11:27:40,245 INFO L87 Difference]: Start difference. First operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 73 states. [2022-04-27 11:27:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:27:40,247 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-27 11:27:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-27 11:27:40,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:27:40,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:27:40,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:27:40,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:27:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:27:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-27 11:27:40,248 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 35 [2022-04-27 11:27:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:27:40,249 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-27 11:27:40,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-27 11:27:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 11:27:40,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:27:40,250 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:27:40,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:27:40,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:40,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:27:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:27:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash -110156846, now seen corresponding path program 4 times [2022-04-27 11:27:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:27:40,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654392538] [2022-04-27 11:27:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:27:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:27:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:27:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:40,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {1857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-27 11:27:40,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-27 11:27:40,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1829#true} {1829#true} #85#return; {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:27:40,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #85#return; {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret9 := main(); {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {1829#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1829#true} is VALID [2022-04-27 11:27:40,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1834#(= main_~v~0 0)} is VALID [2022-04-27 11:27:40,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {1834#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {1834#(= main_~v~0 0)} is VALID [2022-04-27 11:27:40,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:40,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:40,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:40,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:40,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:40,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:40,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:40,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:40,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:40,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:40,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:40,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} assume !!(~v~0 % 4294967296 < 268435455); {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:40,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:40,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:40,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:40,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:40,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:40,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} assume !!(~v~0 % 4294967296 < 268435455); {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:40,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:27:40,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} assume !!(~v~0 % 4294967296 < 268435455); {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:27:40,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:27:40,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:27:40,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:27:40,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} assume !!(~v~0 % 4294967296 < 268435455); {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:27:40,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:27:40,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} assume !!(~v~0 % 4294967296 < 268435455); {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:27:40,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:27:40,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:27:40,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:27:40,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} assume !!(~v~0 % 4294967296 < 268435455); {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:27:40,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:27:40,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:27:40,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:27:40,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:27:40,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:27:40,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:27:40,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:27:40,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} assume !!(~v~0 % 4294967296 < 268435455); {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:27:40,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:27:40,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:27:40,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:27:40,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:27:40,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1856#(and (<= main_~v~0 22) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:27:40,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {1856#(and (<= main_~v~0 22) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} assume !(~v~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-27 11:27:40,951 INFO L272 TraceCheckUtils]: 55: Hoare triple {1830#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1830#false} is VALID [2022-04-27 11:27:40,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-27 11:27:40,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-27 11:27:40,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-27 11:27:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:40,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:27:40,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654392538] [2022-04-27 11:27:40,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654392538] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:27:40,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864953040] [2022-04-27 11:27:40,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:27:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:27:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:27:40,954 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-27 11:27:40,955 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-27 11:27:41,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:27:41,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:27:41,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 11:27:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:27:41,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:27:41,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1829#true} is VALID [2022-04-27 11:27:41,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-27 11:27:41,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-27 11:27:41,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #85#return; {1829#true} is VALID [2022-04-27 11:27:41,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret9 := main(); {1829#true} is VALID [2022-04-27 11:27:41,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1829#true} is VALID [2022-04-27 11:27:41,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {1829#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1829#true} is VALID [2022-04-27 11:27:41,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1829#true} is VALID [2022-04-27 11:27:41,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1829#true} is VALID [2022-04-27 11:27:41,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {1834#(= main_~v~0 0)} is VALID [2022-04-27 11:27:41,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {1834#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {1834#(= main_~v~0 0)} is VALID [2022-04-27 11:27:41,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:41,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:27:41,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {1835#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:41,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:27:41,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {1836#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:41,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:27:41,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:41,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:27:41,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {1838#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:41,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:27:41,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#(and (<= main_~v~0 5) (<= 5 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:41,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} assume !!(~v~0 % 4294967296 < 268435455); {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:27:41,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {1840#(and (<= 6 main_~v~0) (<= main_~v~0 6))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:41,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:27:41,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {1841#(and (<= main_~v~0 7) (<= 7 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:41,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:27:41,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {1842#(and (<= main_~v~0 8) (<= 8 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:41,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} assume !!(~v~0 % 4294967296 < 268435455); {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:27:41,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {1843#(and (<= 9 main_~v~0) (<= main_~v~0 9))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:27:41,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} assume !!(~v~0 % 4294967296 < 268435455); {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:27:41,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {1844#(and (<= 10 main_~v~0) (<= main_~v~0 10))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:27:41,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:27:41,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {1845#(and (<= main_~v~0 11) (<= 11 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:27:41,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} assume !!(~v~0 % 4294967296 < 268435455); {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:27:41,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#(and (<= 12 main_~v~0) (<= main_~v~0 12))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:27:41,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} assume !!(~v~0 % 4294967296 < 268435455); {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:27:41,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {1847#(and (<= 13 main_~v~0) (<= main_~v~0 13))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:27:41,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:27:41,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {1848#(and (<= main_~v~0 14) (<= 14 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:27:41,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} assume !!(~v~0 % 4294967296 < 268435455); {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:27:41,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {1849#(and (<= 15 main_~v~0) (<= main_~v~0 15))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:27:41,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:27:41,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {1850#(and (<= main_~v~0 16) (<= 16 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:27:41,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:27:41,562 INFO L290 TraceCheckUtils]: 45: Hoare triple {1851#(and (<= main_~v~0 17) (<= 17 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:27:41,563 INFO L290 TraceCheckUtils]: 46: Hoare triple {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:27:41,563 INFO L290 TraceCheckUtils]: 47: Hoare triple {1852#(and (<= main_~v~0 18) (<= 18 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:27:41,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} assume !!(~v~0 % 4294967296 < 268435455); {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:27:41,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {1853#(and (<= 19 main_~v~0) (<= main_~v~0 19))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:27:41,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:27:41,566 INFO L290 TraceCheckUtils]: 51: Hoare triple {1854#(and (<= main_~v~0 20) (<= 20 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:27:41,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:27:41,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {1855#(and (<= main_~v~0 21) (<= 21 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2020#(and (<= 22 main_~v~0) (<= main_~v~0 22))} is VALID [2022-04-27 11:27:41,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {2020#(and (<= 22 main_~v~0) (<= main_~v~0 22))} assume !(~v~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-27 11:27:41,567 INFO L272 TraceCheckUtils]: 55: Hoare triple {1830#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1830#false} is VALID [2022-04-27 11:27:41,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-27 11:27:41,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-27 11:27:41,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-27 11:27:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:41,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:27:42,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-27 11:27:42,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-27 11:27:42,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-27 11:27:42,571 INFO L272 TraceCheckUtils]: 55: Hoare triple {1830#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {1830#false} is VALID [2022-04-27 11:27:42,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {2048#(< (mod main_~v~0 4294967296) 268435455)} assume !(~v~0 % 4294967296 < 268435455); {1830#false} is VALID [2022-04-27 11:27:42,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {2052#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2048#(< (mod main_~v~0 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {2052#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2052#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {2059#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2052#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {2059#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2059#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {2066#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2059#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,574 INFO L290 TraceCheckUtils]: 48: Hoare triple {2066#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2066#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {2073#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2066#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {2073#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2073#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {2080#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2073#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {2080#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2080#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {2087#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2080#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {2087#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2087#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {2094#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2087#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {2094#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2094#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {2101#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2094#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {2101#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2101#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {2108#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2101#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {2108#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2108#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {2115#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2108#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {2115#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2115#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {2122#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2115#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {2122#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2122#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {2129#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2122#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {2129#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2129#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {2136#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2129#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {2136#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2136#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {2143#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2136#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {2143#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2143#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {2150#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2143#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {2150#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2150#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {2157#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2150#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {2157#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2157#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {2164#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2157#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {2164#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2164#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2171#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2164#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {2171#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2171#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {2178#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2171#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {2178#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2178#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2178#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2185#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2185#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {2192#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2192#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {2199#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {2192#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {2199#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {2199#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {2199#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} is VALID [2022-04-27 11:27:42,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {1829#true} is VALID [2022-04-27 11:27:42,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {1829#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {1829#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {1829#true} call #t~ret9 := main(); {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1829#true} {1829#true} #85#return; {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#true} assume true; {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1829#true} is VALID [2022-04-27 11:27:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:27:42,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864953040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:27:42,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:27:42,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 11:27:42,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674552555] [2022-04-27 11:27:42,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:27:42,596 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-27 11:27:42,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:27:42,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:27:42,687 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-27 11:27:42,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 11:27:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:27:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 11:27:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 11:27:42,688 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:32,976 INFO L93 Difference]: Finished difference Result 181 states and 216 transitions. [2022-04-27 11:29:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 11:29:32,977 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-27 11:29:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:29:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 173 transitions. [2022-04-27 11:29:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 173 transitions. [2022-04-27 11:29:32,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 173 transitions. [2022-04-27 11:29:33,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:29:33,251 INFO L225 Difference]: With dead ends: 181 [2022-04-27 11:29:33,251 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 11:29:33,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 108.7s TimeCoverageRelationStatistics Valid=2438, Invalid=6677, Unknown=5, NotChecked=0, Total=9120 [2022-04-27 11:29:33,253 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 149 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:29:33,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 141 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:29:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 11:29:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2022-04-27 11:29:33,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:29:33,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:29:33,324 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:29:33,324 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:29:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:33,326 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-04-27 11:29:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2022-04-27 11:29:33,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:33,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:33,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 121 states. [2022-04-27 11:29:33,327 INFO L87 Difference]: Start difference. First operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 121 states. [2022-04-27 11:29:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:29:33,329 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-04-27 11:29:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2022-04-27 11:29:33,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:29:33,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:29:33,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:29:33,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:29:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 108 states have internal predecessors, (113), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:29:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2022-04-27 11:29:33,331 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 59 [2022-04-27 11:29:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:29:33,331 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2022-04-27 11:29:33,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 49 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:29:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-27 11:29:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-27 11:29:33,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:29:33,332 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:29:33,349 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-27 11:29:33,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:29:33,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:29:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:29:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1588006238, now seen corresponding path program 5 times [2022-04-27 11:29:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:29:33,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429136136] [2022-04-27 11:29:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:29:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:29:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:29:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:29:34,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {3064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:29:34,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:29:34,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3012#true} {3012#true} #85#return; {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} call ULTIMATE.init(); {3064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:29:34,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {3064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} #85#return; {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} call #t~ret9 := main(); {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {3012#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {3012#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {3012#true} is VALID [2022-04-27 11:29:34,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {3012#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {3012#true} is VALID [2022-04-27 11:29:34,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {3012#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {3017#(= main_~v~0 0)} is VALID [2022-04-27 11:29:34,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {3017#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {3017#(= main_~v~0 0)} is VALID [2022-04-27 11:29:34,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {3017#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:29:34,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:29:34,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:29:34,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:29:34,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:29:34,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:29:34,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:29:34,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:29:34,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:29:34,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:29:34,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:29:34,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} assume !!(~v~0 % 4294967296 < 268435455); {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:29:34,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:29:34,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:29:34,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:29:34,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:29:34,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:29:34,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} assume !!(~v~0 % 4294967296 < 268435455); {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:29:34,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:29:34,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} assume !!(~v~0 % 4294967296 < 268435455); {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:29:34,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:29:34,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:29:34,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:29:34,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} assume !!(~v~0 % 4294967296 < 268435455); {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:29:34,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:29:34,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} assume !!(~v~0 % 4294967296 < 268435455); {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:29:34,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:29:34,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:29:34,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:29:34,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} assume !!(~v~0 % 4294967296 < 268435455); {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:29:34,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:29:34,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:29:34,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:29:34,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:29:34,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:29:34,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:29:34,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:29:34,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} assume !!(~v~0 % 4294967296 < 268435455); {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:29:34,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:29:34,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:29:34,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:29:34,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:29:34,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} is VALID [2022-04-27 11:29:34,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} assume !!(~v~0 % 4294967296 < 268435455); {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} is VALID [2022-04-27 11:29:34,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} is VALID [2022-04-27 11:29:34,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} assume !!(~v~0 % 4294967296 < 268435455); {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} is VALID [2022-04-27 11:29:34,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} is VALID [2022-04-27 11:29:34,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} is VALID [2022-04-27 11:29:34,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} is VALID [2022-04-27 11:29:34,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} assume !!(~v~0 % 4294967296 < 268435455); {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} is VALID [2022-04-27 11:29:34,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} is VALID [2022-04-27 11:29:34,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} assume !!(~v~0 % 4294967296 < 268435455); {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} is VALID [2022-04-27 11:29:34,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} is VALID [2022-04-27 11:29:34,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} assume !!(~v~0 % 4294967296 < 268435455); {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} is VALID [2022-04-27 11:29:34,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} is VALID [2022-04-27 11:29:34,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} is VALID [2022-04-27 11:29:34,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} is VALID [2022-04-27 11:29:34,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} is VALID [2022-04-27 11:29:34,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} is VALID [2022-04-27 11:29:34,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} assume !!(~v~0 % 4294967296 < 268435455); {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} is VALID [2022-04-27 11:29:34,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} is VALID [2022-04-27 11:29:34,827 INFO L290 TraceCheckUtils]: 72: Hoare triple {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} assume !!(~v~0 % 4294967296 < 268435455); {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} is VALID [2022-04-27 11:29:34,827 INFO L290 TraceCheckUtils]: 73: Hoare triple {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} is VALID [2022-04-27 11:29:34,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} is VALID [2022-04-27 11:29:34,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} is VALID [2022-04-27 11:29:34,829 INFO L290 TraceCheckUtils]: 76: Hoare triple {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} is VALID [2022-04-27 11:29:34,829 INFO L290 TraceCheckUtils]: 77: Hoare triple {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} is VALID [2022-04-27 11:29:34,829 INFO L290 TraceCheckUtils]: 78: Hoare triple {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} assume !!(~v~0 % 4294967296 < 268435455); {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} is VALID [2022-04-27 11:29:34,830 INFO L290 TraceCheckUtils]: 79: Hoare triple {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} is VALID [2022-04-27 11:29:34,830 INFO L290 TraceCheckUtils]: 80: Hoare triple {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} assume !!(~v~0 % 4294967296 < 268435455); {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} is VALID [2022-04-27 11:29:34,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} is VALID [2022-04-27 11:29:34,831 INFO L290 TraceCheckUtils]: 82: Hoare triple {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} assume !!(~v~0 % 4294967296 < 268435455); {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} is VALID [2022-04-27 11:29:34,831 INFO L290 TraceCheckUtils]: 83: Hoare triple {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} is VALID [2022-04-27 11:29:34,832 INFO L290 TraceCheckUtils]: 84: Hoare triple {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} is VALID [2022-04-27 11:29:34,832 INFO L290 TraceCheckUtils]: 85: Hoare triple {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} is VALID [2022-04-27 11:29:34,832 INFO L290 TraceCheckUtils]: 86: Hoare triple {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} assume !!(~v~0 % 4294967296 < 268435455); {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} is VALID [2022-04-27 11:29:34,833 INFO L290 TraceCheckUtils]: 87: Hoare triple {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} is VALID [2022-04-27 11:29:34,833 INFO L290 TraceCheckUtils]: 88: Hoare triple {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} is VALID [2022-04-27 11:29:34,833 INFO L290 TraceCheckUtils]: 89: Hoare triple {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} is VALID [2022-04-27 11:29:34,834 INFO L290 TraceCheckUtils]: 90: Hoare triple {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} is VALID [2022-04-27 11:29:34,834 INFO L290 TraceCheckUtils]: 91: Hoare triple {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} is VALID [2022-04-27 11:29:34,835 INFO L290 TraceCheckUtils]: 92: Hoare triple {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} is VALID [2022-04-27 11:29:34,835 INFO L290 TraceCheckUtils]: 93: Hoare triple {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} is VALID [2022-04-27 11:29:34,835 INFO L290 TraceCheckUtils]: 94: Hoare triple {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} is VALID [2022-04-27 11:29:34,836 INFO L290 TraceCheckUtils]: 95: Hoare triple {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} is VALID [2022-04-27 11:29:34,836 INFO L290 TraceCheckUtils]: 96: Hoare triple {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} is VALID [2022-04-27 11:29:34,836 INFO L290 TraceCheckUtils]: 97: Hoare triple {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} is VALID [2022-04-27 11:29:34,837 INFO L290 TraceCheckUtils]: 98: Hoare triple {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} assume !!(~v~0 % 4294967296 < 268435455); {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} is VALID [2022-04-27 11:29:34,837 INFO L290 TraceCheckUtils]: 99: Hoare triple {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} is VALID [2022-04-27 11:29:34,838 INFO L290 TraceCheckUtils]: 100: Hoare triple {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} is VALID [2022-04-27 11:29:34,838 INFO L290 TraceCheckUtils]: 101: Hoare triple {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3063#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 46))} is VALID [2022-04-27 11:29:34,839 INFO L290 TraceCheckUtils]: 102: Hoare triple {3063#(and (not (<= (+ (div main_~v~0 4294967296) 1) 0)) (<= main_~v~0 46))} assume !(~v~0 % 4294967296 < 268435455); {3013#false} is VALID [2022-04-27 11:29:34,839 INFO L272 TraceCheckUtils]: 103: Hoare triple {3013#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3013#false} is VALID [2022-04-27 11:29:34,839 INFO L290 TraceCheckUtils]: 104: Hoare triple {3013#false} ~cond := #in~cond; {3013#false} is VALID [2022-04-27 11:29:34,839 INFO L290 TraceCheckUtils]: 105: Hoare triple {3013#false} assume 0 == ~cond; {3013#false} is VALID [2022-04-27 11:29:34,839 INFO L290 TraceCheckUtils]: 106: Hoare triple {3013#false} assume !false; {3013#false} is VALID [2022-04-27 11:29:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:29:34,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:29:34,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429136136] [2022-04-27 11:29:34,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429136136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:29:34,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577827748] [2022-04-27 11:29:34,840 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:29:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:29:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:29:34,841 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-27 11:29:34,842 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-27 11:31:40,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-27 11:31:40,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:31:40,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-27 11:31:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:31:40,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:31:41,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} call ULTIMATE.init(); {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} #85#return; {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} call #t~ret9 := main(); {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {3012#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {3012#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {3012#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {3012#true} is VALID [2022-04-27 11:31:41,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {3012#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {3017#(= main_~v~0 0)} is VALID [2022-04-27 11:31:41,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {3017#(= main_~v~0 0)} assume !!(~v~0 % 4294967296 < 268435455); {3017#(= main_~v~0 0)} is VALID [2022-04-27 11:31:41,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {3017#(= main_~v~0 0)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:31:41,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 11:31:41,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {3018#(and (<= main_~v~0 1) (<= 1 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:31:41,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} assume !!(~v~0 % 4294967296 < 268435455); {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 11:31:41,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {3019#(and (<= 2 main_~v~0) (<= main_~v~0 2))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:31:41,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 11:31:41,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(and (<= main_~v~0 3) (<= 3 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:31:41,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 11:31:41,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {3021#(and (<= main_~v~0 4) (<= 4 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:31:41,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 11:31:41,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {3022#(and (<= main_~v~0 5) (<= 5 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:31:41,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} assume !!(~v~0 % 4294967296 < 268435455); {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 11:31:41,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {3023#(and (<= 6 main_~v~0) (<= main_~v~0 6))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:31:41,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 11:31:41,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {3024#(and (<= main_~v~0 7) (<= 7 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:31:41,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 11:31:41,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {3025#(and (<= main_~v~0 8) (<= 8 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:31:41,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} assume !!(~v~0 % 4294967296 < 268435455); {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 11:31:41,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {3026#(and (<= 9 main_~v~0) (<= main_~v~0 9))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:31:41,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} assume !!(~v~0 % 4294967296 < 268435455); {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} is VALID [2022-04-27 11:31:41,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {3027#(and (<= 10 main_~v~0) (<= main_~v~0 10))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:31:41,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} is VALID [2022-04-27 11:31:41,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {3028#(and (<= main_~v~0 11) (<= 11 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:31:41,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} assume !!(~v~0 % 4294967296 < 268435455); {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} is VALID [2022-04-27 11:31:41,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {3029#(and (<= 12 main_~v~0) (<= main_~v~0 12))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:31:41,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} assume !!(~v~0 % 4294967296 < 268435455); {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} is VALID [2022-04-27 11:31:41,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {3030#(and (<= 13 main_~v~0) (<= main_~v~0 13))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:31:41,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} is VALID [2022-04-27 11:31:41,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {3031#(and (<= main_~v~0 14) (<= 14 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:31:41,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} assume !!(~v~0 % 4294967296 < 268435455); {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} is VALID [2022-04-27 11:31:41,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {3032#(and (<= 15 main_~v~0) (<= main_~v~0 15))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:31:41,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} is VALID [2022-04-27 11:31:41,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {3033#(and (<= main_~v~0 16) (<= 16 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:31:41,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} is VALID [2022-04-27 11:31:41,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {3034#(and (<= main_~v~0 17) (<= 17 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:31:41,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} is VALID [2022-04-27 11:31:41,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {3035#(and (<= main_~v~0 18) (<= 18 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:31:41,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} assume !!(~v~0 % 4294967296 < 268435455); {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} is VALID [2022-04-27 11:31:41,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {3036#(and (<= 19 main_~v~0) (<= main_~v~0 19))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:31:41,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} is VALID [2022-04-27 11:31:41,543 INFO L290 TraceCheckUtils]: 51: Hoare triple {3037#(and (<= main_~v~0 20) (<= 20 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:31:41,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} is VALID [2022-04-27 11:31:41,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {3038#(and (<= main_~v~0 21) (<= 21 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} is VALID [2022-04-27 11:31:41,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} assume !!(~v~0 % 4294967296 < 268435455); {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} is VALID [2022-04-27 11:31:41,544 INFO L290 TraceCheckUtils]: 55: Hoare triple {3039#(and (<= 22 main_~v~0) (<= main_~v~0 22))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} is VALID [2022-04-27 11:31:41,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} assume !!(~v~0 % 4294967296 < 268435455); {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} is VALID [2022-04-27 11:31:41,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {3040#(and (<= 23 main_~v~0) (<= main_~v~0 23))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} is VALID [2022-04-27 11:31:41,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} is VALID [2022-04-27 11:31:41,546 INFO L290 TraceCheckUtils]: 59: Hoare triple {3041#(and (<= main_~v~0 24) (<= 24 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} is VALID [2022-04-27 11:31:41,546 INFO L290 TraceCheckUtils]: 60: Hoare triple {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} assume !!(~v~0 % 4294967296 < 268435455); {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} is VALID [2022-04-27 11:31:41,547 INFO L290 TraceCheckUtils]: 61: Hoare triple {3042#(and (<= 25 main_~v~0) (<= main_~v~0 25))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} is VALID [2022-04-27 11:31:41,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} assume !!(~v~0 % 4294967296 < 268435455); {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} is VALID [2022-04-27 11:31:41,548 INFO L290 TraceCheckUtils]: 63: Hoare triple {3043#(and (<= 26 main_~v~0) (<= main_~v~0 26))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} is VALID [2022-04-27 11:31:41,548 INFO L290 TraceCheckUtils]: 64: Hoare triple {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} assume !!(~v~0 % 4294967296 < 268435455); {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} is VALID [2022-04-27 11:31:41,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {3044#(and (<= 27 main_~v~0) (<= main_~v~0 27))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} is VALID [2022-04-27 11:31:41,549 INFO L290 TraceCheckUtils]: 66: Hoare triple {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} is VALID [2022-04-27 11:31:41,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {3045#(and (<= main_~v~0 28) (<= 28 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} is VALID [2022-04-27 11:31:41,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} is VALID [2022-04-27 11:31:41,550 INFO L290 TraceCheckUtils]: 69: Hoare triple {3046#(and (<= main_~v~0 29) (<= 29 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} is VALID [2022-04-27 11:31:41,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} assume !!(~v~0 % 4294967296 < 268435455); {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} is VALID [2022-04-27 11:31:41,551 INFO L290 TraceCheckUtils]: 71: Hoare triple {3047#(and (<= 30 main_~v~0) (<= main_~v~0 30))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} is VALID [2022-04-27 11:31:41,551 INFO L290 TraceCheckUtils]: 72: Hoare triple {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} assume !!(~v~0 % 4294967296 < 268435455); {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} is VALID [2022-04-27 11:31:41,551 INFO L290 TraceCheckUtils]: 73: Hoare triple {3048#(and (<= 31 main_~v~0) (<= main_~v~0 31))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} is VALID [2022-04-27 11:31:41,552 INFO L290 TraceCheckUtils]: 74: Hoare triple {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} is VALID [2022-04-27 11:31:41,552 INFO L290 TraceCheckUtils]: 75: Hoare triple {3049#(and (<= main_~v~0 32) (<= 32 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} is VALID [2022-04-27 11:31:41,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} is VALID [2022-04-27 11:31:41,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {3050#(and (<= main_~v~0 33) (<= 33 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} is VALID [2022-04-27 11:31:41,553 INFO L290 TraceCheckUtils]: 78: Hoare triple {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} assume !!(~v~0 % 4294967296 < 268435455); {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} is VALID [2022-04-27 11:31:41,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {3051#(and (<= 34 main_~v~0) (<= main_~v~0 34))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} is VALID [2022-04-27 11:31:41,554 INFO L290 TraceCheckUtils]: 80: Hoare triple {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} assume !!(~v~0 % 4294967296 < 268435455); {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} is VALID [2022-04-27 11:31:41,555 INFO L290 TraceCheckUtils]: 81: Hoare triple {3052#(and (<= 35 main_~v~0) (<= main_~v~0 35))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} is VALID [2022-04-27 11:31:41,555 INFO L290 TraceCheckUtils]: 82: Hoare triple {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} assume !!(~v~0 % 4294967296 < 268435455); {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} is VALID [2022-04-27 11:31:41,555 INFO L290 TraceCheckUtils]: 83: Hoare triple {3053#(and (<= 36 main_~v~0) (<= main_~v~0 36))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} is VALID [2022-04-27 11:31:41,556 INFO L290 TraceCheckUtils]: 84: Hoare triple {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} is VALID [2022-04-27 11:31:41,556 INFO L290 TraceCheckUtils]: 85: Hoare triple {3054#(and (<= main_~v~0 37) (<= 37 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} is VALID [2022-04-27 11:31:41,557 INFO L290 TraceCheckUtils]: 86: Hoare triple {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} assume !!(~v~0 % 4294967296 < 268435455); {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} is VALID [2022-04-27 11:31:41,557 INFO L290 TraceCheckUtils]: 87: Hoare triple {3055#(and (<= 38 main_~v~0) (<= main_~v~0 38))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} is VALID [2022-04-27 11:31:41,557 INFO L290 TraceCheckUtils]: 88: Hoare triple {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} is VALID [2022-04-27 11:31:41,558 INFO L290 TraceCheckUtils]: 89: Hoare triple {3056#(and (<= main_~v~0 39) (<= 39 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} is VALID [2022-04-27 11:31:41,558 INFO L290 TraceCheckUtils]: 90: Hoare triple {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} is VALID [2022-04-27 11:31:41,559 INFO L290 TraceCheckUtils]: 91: Hoare triple {3057#(and (<= main_~v~0 40) (<= 40 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} is VALID [2022-04-27 11:31:41,559 INFO L290 TraceCheckUtils]: 92: Hoare triple {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} is VALID [2022-04-27 11:31:41,559 INFO L290 TraceCheckUtils]: 93: Hoare triple {3058#(and (<= main_~v~0 41) (<= 41 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} is VALID [2022-04-27 11:31:41,560 INFO L290 TraceCheckUtils]: 94: Hoare triple {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} is VALID [2022-04-27 11:31:41,560 INFO L290 TraceCheckUtils]: 95: Hoare triple {3059#(and (<= main_~v~0 42) (<= 42 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} is VALID [2022-04-27 11:31:41,560 INFO L290 TraceCheckUtils]: 96: Hoare triple {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} is VALID [2022-04-27 11:31:41,561 INFO L290 TraceCheckUtils]: 97: Hoare triple {3060#(and (<= main_~v~0 43) (<= 43 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} is VALID [2022-04-27 11:31:41,561 INFO L290 TraceCheckUtils]: 98: Hoare triple {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} assume !!(~v~0 % 4294967296 < 268435455); {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} is VALID [2022-04-27 11:31:41,562 INFO L290 TraceCheckUtils]: 99: Hoare triple {3061#(and (<= 44 main_~v~0) (<= main_~v~0 44))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} is VALID [2022-04-27 11:31:41,562 INFO L290 TraceCheckUtils]: 100: Hoare triple {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} assume !!(~v~0 % 4294967296 < 268435455); {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} is VALID [2022-04-27 11:31:41,562 INFO L290 TraceCheckUtils]: 101: Hoare triple {3062#(and (<= main_~v~0 45) (<= 45 main_~v~0))} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3371#(and (<= 46 main_~v~0) (<= main_~v~0 46))} is VALID [2022-04-27 11:31:41,563 INFO L290 TraceCheckUtils]: 102: Hoare triple {3371#(and (<= 46 main_~v~0) (<= main_~v~0 46))} assume !(~v~0 % 4294967296 < 268435455); {3013#false} is VALID [2022-04-27 11:31:41,563 INFO L272 TraceCheckUtils]: 103: Hoare triple {3013#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3013#false} is VALID [2022-04-27 11:31:41,563 INFO L290 TraceCheckUtils]: 104: Hoare triple {3013#false} ~cond := #in~cond; {3013#false} is VALID [2022-04-27 11:31:41,563 INFO L290 TraceCheckUtils]: 105: Hoare triple {3013#false} assume 0 == ~cond; {3013#false} is VALID [2022-04-27 11:31:41,563 INFO L290 TraceCheckUtils]: 106: Hoare triple {3013#false} assume !false; {3013#false} is VALID [2022-04-27 11:31:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:31:41,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:31:44,998 INFO L290 TraceCheckUtils]: 106: Hoare triple {3013#false} assume !false; {3013#false} is VALID [2022-04-27 11:31:44,999 INFO L290 TraceCheckUtils]: 105: Hoare triple {3013#false} assume 0 == ~cond; {3013#false} is VALID [2022-04-27 11:31:44,999 INFO L290 TraceCheckUtils]: 104: Hoare triple {3013#false} ~cond := #in~cond; {3013#false} is VALID [2022-04-27 11:31:44,999 INFO L272 TraceCheckUtils]: 103: Hoare triple {3013#false} call __VERIFIER_assert((if 0 == (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {3013#false} is VALID [2022-04-27 11:31:44,999 INFO L290 TraceCheckUtils]: 102: Hoare triple {3399#(< (mod main_~v~0 4294967296) 268435455)} assume !(~v~0 % 4294967296 < 268435455); {3013#false} is VALID [2022-04-27 11:31:45,003 INFO L290 TraceCheckUtils]: 101: Hoare triple {3403#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3399#(< (mod main_~v~0 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,003 INFO L290 TraceCheckUtils]: 100: Hoare triple {3403#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3403#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,004 INFO L290 TraceCheckUtils]: 99: Hoare triple {3410#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3403#(< (mod (+ main_~v~0 1) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {3410#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3410#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,005 INFO L290 TraceCheckUtils]: 97: Hoare triple {3417#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3410#(< (mod (+ main_~v~0 2) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,005 INFO L290 TraceCheckUtils]: 96: Hoare triple {3417#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3417#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,006 INFO L290 TraceCheckUtils]: 95: Hoare triple {3424#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3417#(< (mod (+ main_~v~0 3) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,006 INFO L290 TraceCheckUtils]: 94: Hoare triple {3424#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3424#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,007 INFO L290 TraceCheckUtils]: 93: Hoare triple {3431#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3424#(< (mod (+ main_~v~0 4) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,007 INFO L290 TraceCheckUtils]: 92: Hoare triple {3431#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3431#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,008 INFO L290 TraceCheckUtils]: 91: Hoare triple {3438#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3431#(< (mod (+ 5 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,008 INFO L290 TraceCheckUtils]: 90: Hoare triple {3438#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3438#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,009 INFO L290 TraceCheckUtils]: 89: Hoare triple {3445#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3438#(< (mod (+ main_~v~0 6) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,009 INFO L290 TraceCheckUtils]: 88: Hoare triple {3445#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3445#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,009 INFO L290 TraceCheckUtils]: 87: Hoare triple {3452#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3445#(< (mod (+ 7 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,010 INFO L290 TraceCheckUtils]: 86: Hoare triple {3452#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3452#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,010 INFO L290 TraceCheckUtils]: 85: Hoare triple {3459#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3452#(< (mod (+ main_~v~0 8) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,010 INFO L290 TraceCheckUtils]: 84: Hoare triple {3459#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3459#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,011 INFO L290 TraceCheckUtils]: 83: Hoare triple {3466#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3459#(< (mod (+ main_~v~0 9) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {3466#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3466#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,012 INFO L290 TraceCheckUtils]: 81: Hoare triple {3473#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3466#(< (mod (+ main_~v~0 10) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {3473#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3473#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {3480#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3473#(< (mod (+ main_~v~0 11) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {3480#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3480#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {3487#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3480#(< (mod (+ main_~v~0 12) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {3487#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3487#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,015 INFO L290 TraceCheckUtils]: 75: Hoare triple {3494#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3487#(< (mod (+ main_~v~0 13) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,015 INFO L290 TraceCheckUtils]: 74: Hoare triple {3494#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3494#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,015 INFO L290 TraceCheckUtils]: 73: Hoare triple {3501#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3494#(< (mod (+ main_~v~0 14) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,016 INFO L290 TraceCheckUtils]: 72: Hoare triple {3501#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3501#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,016 INFO L290 TraceCheckUtils]: 71: Hoare triple {3508#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3501#(< (mod (+ main_~v~0 15) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,017 INFO L290 TraceCheckUtils]: 70: Hoare triple {3508#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3508#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {3515#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3508#(< (mod (+ main_~v~0 16) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {3515#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3515#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {3522#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3515#(< (mod (+ main_~v~0 17) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {3522#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3522#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,019 INFO L290 TraceCheckUtils]: 65: Hoare triple {3529#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3522#(< (mod (+ main_~v~0 18) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,019 INFO L290 TraceCheckUtils]: 64: Hoare triple {3529#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3529#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {3536#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3529#(< (mod (+ 19 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {3536#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3536#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,021 INFO L290 TraceCheckUtils]: 61: Hoare triple {3543#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3536#(< (mod (+ main_~v~0 20) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {3543#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3543#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {3550#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3543#(< (mod (+ main_~v~0 21) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {3550#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3550#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {3557#(< (mod (+ 23 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3550#(< (mod (+ main_~v~0 22) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {3557#(< (mod (+ 23 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3557#(< (mod (+ 23 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {3564#(< (mod (+ main_~v~0 24) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3557#(< (mod (+ 23 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {3564#(< (mod (+ main_~v~0 24) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3564#(< (mod (+ main_~v~0 24) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {3571#(< (mod (+ main_~v~0 25) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3564#(< (mod (+ main_~v~0 24) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {3571#(< (mod (+ main_~v~0 25) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3571#(< (mod (+ main_~v~0 25) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {3578#(< (mod (+ main_~v~0 26) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3571#(< (mod (+ main_~v~0 25) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {3578#(< (mod (+ main_~v~0 26) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3578#(< (mod (+ main_~v~0 26) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {3585#(< (mod (+ main_~v~0 27) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3578#(< (mod (+ main_~v~0 26) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {3585#(< (mod (+ main_~v~0 27) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3585#(< (mod (+ main_~v~0 27) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {3592#(< (mod (+ main_~v~0 28) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3585#(< (mod (+ main_~v~0 27) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {3592#(< (mod (+ main_~v~0 28) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3592#(< (mod (+ main_~v~0 28) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {3599#(< (mod (+ 29 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3592#(< (mod (+ main_~v~0 28) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {3599#(< (mod (+ 29 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3599#(< (mod (+ 29 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {3606#(< (mod (+ 30 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3599#(< (mod (+ 29 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {3606#(< (mod (+ 30 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3606#(< (mod (+ 30 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {3613#(< (mod (+ main_~v~0 31) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3606#(< (mod (+ 30 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {3613#(< (mod (+ main_~v~0 31) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3613#(< (mod (+ main_~v~0 31) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {3620#(< (mod (+ 32 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3613#(< (mod (+ main_~v~0 31) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {3620#(< (mod (+ 32 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3620#(< (mod (+ 32 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {3627#(< (mod (+ main_~v~0 33) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3620#(< (mod (+ 32 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {3627#(< (mod (+ main_~v~0 33) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3627#(< (mod (+ main_~v~0 33) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {3634#(< (mod (+ main_~v~0 34) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3627#(< (mod (+ main_~v~0 33) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {3634#(< (mod (+ main_~v~0 34) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3634#(< (mod (+ main_~v~0 34) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {3641#(< (mod (+ 35 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3634#(< (mod (+ main_~v~0 34) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {3641#(< (mod (+ 35 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3641#(< (mod (+ 35 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {3648#(< (mod (+ main_~v~0 36) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3641#(< (mod (+ 35 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {3648#(< (mod (+ main_~v~0 36) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3648#(< (mod (+ main_~v~0 36) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {3655#(< (mod (+ main_~v~0 37) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3648#(< (mod (+ main_~v~0 36) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {3655#(< (mod (+ main_~v~0 37) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3655#(< (mod (+ main_~v~0 37) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {3662#(< (mod (+ main_~v~0 38) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3655#(< (mod (+ main_~v~0 37) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {3662#(< (mod (+ main_~v~0 38) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3662#(< (mod (+ main_~v~0 38) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {3669#(< (mod (+ main_~v~0 39) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3662#(< (mod (+ main_~v~0 38) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {3669#(< (mod (+ main_~v~0 39) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3669#(< (mod (+ main_~v~0 39) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {3676#(< (mod (+ 40 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3669#(< (mod (+ main_~v~0 39) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {3676#(< (mod (+ 40 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3676#(< (mod (+ 40 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {3683#(< (mod (+ 41 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3676#(< (mod (+ 40 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {3683#(< (mod (+ 41 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3683#(< (mod (+ 41 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {3690#(< (mod (+ 42 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3683#(< (mod (+ 41 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {3690#(< (mod (+ 42 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3690#(< (mod (+ 42 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {3697#(< (mod (+ main_~v~0 43) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3690#(< (mod (+ 42 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {3697#(< (mod (+ main_~v~0 43) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3697#(< (mod (+ main_~v~0 43) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {3704#(< (mod (+ 44 main_~v~0) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3697#(< (mod (+ main_~v~0 43) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {3704#(< (mod (+ 44 main_~v~0) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3704#(< (mod (+ 44 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {3711#(< (mod (+ main_~v~0 45) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3704#(< (mod (+ 44 main_~v~0) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {3711#(< (mod (+ main_~v~0 45) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3711#(< (mod (+ main_~v~0 45) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {3718#(< (mod (+ main_~v~0 46) 4294967296) 268435455)} #t~post8 := ~v~0;~v~0 := 1 + #t~post8;havoc #t~post8; {3711#(< (mod (+ main_~v~0 45) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {3718#(< (mod (+ main_~v~0 46) 4294967296) 268435455)} assume !!(~v~0 % 4294967296 < 268435455); {3718#(< (mod (+ main_~v~0 46) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {3012#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {3718#(< (mod (+ main_~v~0 46) 4294967296) 268435455)} is VALID [2022-04-27 11:31:45,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {3012#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {3012#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {3012#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {3012#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {3012#true} call #t~ret9 := main(); {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3012#true} {3012#true} #85#return; {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {3012#true} assume true; {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {3012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3012#true} is VALID [2022-04-27 11:31:45,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {3012#true} call ULTIMATE.init(); {3012#true} is VALID [2022-04-27 11:31:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:31:45,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577827748] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:31:45,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:31:45,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-27 11:31:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589543847] [2022-04-27 11:31:45,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:31:45,057 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.0408163265306123) internal successors, (200), 97 states have internal predecessors, (200), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-04-27 11:31:45,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:31:45,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 2.0408163265306123) internal successors, (200), 97 states have internal predecessors, (200), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:31:45,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:31:45,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-27 11:31:45,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:31:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-27 11:31:45,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-27 11:31:45,213 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 98 states, 98 states have (on average 2.0408163265306123) internal successors, (200), 97 states have internal predecessors, (200), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:31:54,215 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ 44 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 43) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ c_main_~v~0 46) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 45) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-04-27 11:32:44,126 WARN L232 SmtUtils]: Spent 14.16s on a formula simplification. DAG size of input: 188 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:33:26,921 WARN L232 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 192 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:34:30,170 WARN L232 SmtUtils]: Spent 13.62s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:34:32,230 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ c_main_~v~0 39) 4294967296) 268435455) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ c_main_~v~0 38) 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ 42 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 43) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ 41 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-04-27 11:35:36,360 WARN L232 SmtUtils]: Spent 11.81s on a formula simplification. DAG size of input: 176 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:36:25,839 WARN L232 SmtUtils]: Spent 10.66s on a formula simplification. DAG size of input: 180 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:37:20,725 WARN L232 SmtUtils]: Spent 9.14s on a formula simplification. DAG size of input: 176 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:38:34,049 WARN L232 SmtUtils]: Spent 14.96s on a formula simplification. DAG size of input: 172 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:39:34,078 WARN L232 SmtUtils]: Spent 10.90s on a formula simplification. DAG size of input: 168 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:40:31,419 WARN L232 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 164 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:40:33,474 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 7 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 24) 4294967296) 268435455) (< (mod (+ c_main_~v~0 36) 4294967296) 268435455) (< (mod (+ c_main_~v~0 6) 4294967296) 268435455) (< (mod (+ c_main_~v~0 17) 4294967296) 268435455) (< (mod (+ c_main_~v~0 13) 4294967296) 268435455) (< (mod (+ c_main_~v~0 18) 4294967296) 268435455) (< (mod (+ 32 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 28) 4294967296) 268435455) (< (mod (+ c_main_~v~0 20) 4294967296) 268435455) (< (mod (+ 29 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~v~0) 4294967296) 268435455) (< (mod c_main_~v~0 4294967296) 268435455) (< (mod (+ 9 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 4) 4294967296) 268435455) (< (mod (+ c_main_~v~0 26) 4294967296) 268435455) (< (mod (+ 30 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 10) 4294967296) 268435455) (< (mod (+ 19 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 25) 4294967296) 268435455) (< (mod (+ c_main_~v~0 34) 4294967296) 268435455) (< (mod (+ c_main_~v~0 31) 4294967296) 268435455) (< (mod (+ 23 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 1) 4294967296) 268435455) (< (mod (+ 14 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 37) 4294967296) 268435455) (< (mod (+ c_main_~v~0 12) 4294967296) 268435455) (< (mod (+ c_main_~v~0 33) 4294967296) 268435455) (< (mod (+ 16 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 11) 4294967296) 268435455) (< (mod (+ c_main_~v~0 15) 4294967296) 268435455) (< (mod (+ 5 c_main_~v~0) 4294967296) 268435455) (< (mod (+ c_main_~v~0 8) 4294967296) 268435455) (< (mod (+ c_main_~v~0 27) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 3 c_main_~v~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~v~0) 4294967296) 268435455)) is different from false [2022-04-27 11:41:47,289 WARN L232 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 152 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)