/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/in-de31.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:08:18,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:08:18,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:08:18,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:08:18,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:08:18,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:08:18,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:08:18,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:08:18,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:08:18,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:08:18,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:08:18,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:08:18,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:08:18,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:08:18,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:08:18,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:08:18,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:08:18,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:08:18,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:08:18,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:08:18,905 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:08:18,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:08:18,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:08:18,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:08:18,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:08:18,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:08:18,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:08:18,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:08:18,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:08:18,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:08:18,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:08:18,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:08:18,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:08:18,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:08:18,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:08:18,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:08:18,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:08:18,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:08:18,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:08:18,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:08:18,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:08:18,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:08:18,923 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:08:18,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:08:18,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:08:18,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:08:18,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:08:18,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:08:18,946 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:08:18,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:08:18,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:08:18,947 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:08:18,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:08:18,948 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:08:18,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:08:18,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:08:18,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:08:18,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:08:18,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:08:18,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:08:18,949 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:08:18,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:08:18,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:08:18,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:08:18,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:08:18,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:08:18,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:08:18,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:08:18,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:08:18,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:08:18,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:08:18,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:08:18,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:08:18,950 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:08:18,950 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:08:18,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:08:18,950 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:08:19,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:08:19,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:08:19,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:08:19,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:08:19,158 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:08:19,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-27 11:08:19,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f477594/a8c83580d887438da5070c1dcec25e50/FLAGadf68b0a6 [2022-04-27 11:08:19,547 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:08:19,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-27 11:08:19,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f477594/a8c83580d887438da5070c1dcec25e50/FLAGadf68b0a6 [2022-04-27 11:08:19,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6f477594/a8c83580d887438da5070c1dcec25e50 [2022-04-27 11:08:19,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:08:19,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:08:19,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:08:19,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:08:19,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:08:19,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:19" (1/1) ... [2022-04-27 11:08:19,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1ad0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:19, skipping insertion in model container [2022-04-27 11:08:19,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:19" (1/1) ... [2022-04-27 11:08:19,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:08:19,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:08:20,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c[368,381] [2022-04-27 11:08:20,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:08:20,127 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:08:20,133 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c[368,381] [2022-04-27 11:08:20,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:08:20,144 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:08:20,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20 WrapperNode [2022-04-27 11:08:20,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:08:20,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:08:20,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:08:20,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:08:20,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:08:20,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:08:20,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:08:20,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:08:20,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (1/1) ... [2022-04-27 11:08:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:08:20,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:20,195 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:08:20,218 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:08:20,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:08:20,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:08:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:08:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:08:20,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:08:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:08:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:08:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:08:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:08:20,270 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:08:20,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:08:20,416 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:08:20,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:08:20,421 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 11:08:20,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:20 BoogieIcfgContainer [2022-04-27 11:08:20,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:08:20,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:08:20,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:08:20,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:08:20,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:08:19" (1/3) ... [2022-04-27 11:08:20,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c081161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:20, skipping insertion in model container [2022-04-27 11:08:20,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:20" (2/3) ... [2022-04-27 11:08:20,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c081161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:20, skipping insertion in model container [2022-04-27 11:08:20,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:20" (3/3) ... [2022-04-27 11:08:20,447 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de31.c [2022-04-27 11:08:20,455 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:08:20,456 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:08:20,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:08:20,521 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@4e7469b8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d306bd1 [2022-04-27 11:08:20,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:08:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:08:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:08:20,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:20,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:20,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-27 11:08:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:20,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978631921] [2022-04-27 11:08:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:20,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-27 11:08:20,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:08:20,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-27 11:08:20,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:20,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-27 11:08:20,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:08:20,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-27 11:08:20,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-27 11:08:20,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:08:20,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} is VALID [2022-04-27 11:08:20,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} ~z~0 := ~y~0; {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:20,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:20,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:08:20,898 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:08:20,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:08:20,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-27 11:08:20,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 11:08:20,900 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:08:20,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:20,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978631921] [2022-04-27 11:08:20,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978631921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:08:20,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:08:20,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:08:20,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498662186] [2022-04-27 11:08:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:08:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:08:20,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:20,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:20,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:20,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:08:20,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:20,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:08:20,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:08:20,954 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:21,327 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-27 11:08:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:08:21,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:08:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-27 11:08:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-27 11:08:21,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-27 11:08:21,386 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:08:21,390 INFO L225 Difference]: With dead ends: 49 [2022-04-27 11:08:21,390 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 11:08:21,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:08:21,394 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:21,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:08:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 11:08:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 11:08:21,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:21,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states 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:08:21,411 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states 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:08:21,412 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states 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:08:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:21,413 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 11:08:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 11:08:21,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:21,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:21,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:08:21,414 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 11:08:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:21,415 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 11:08:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 11:08:21,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:21,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:21,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:21,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states 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:08:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-27 11:08:21,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2022-04-27 11:08:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:21,418 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-27 11:08:21,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 11:08:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:08:21,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:21,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:21,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:08:21,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 1 times [2022-04-27 11:08:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:21,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629111334] [2022-04-27 11:08:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:21,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-27 11:08:21,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 11:08:21,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #61#return; {171#true} is VALID [2022-04-27 11:08:21,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:21,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-27 11:08:21,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 11:08:21,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #61#return; {171#true} is VALID [2022-04-27 11:08:21,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret11 := main(); {171#true} is VALID [2022-04-27 11:08:21,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {176#(= main_~y~0 0)} is VALID [2022-04-27 11:08:21,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:21,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:21,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {178#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:21,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {172#false} is VALID [2022-04-27 11:08:21,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !(~y~0 % 4294967296 > 0); {172#false} is VALID [2022-04-27 11:08:21,492 INFO L272 TraceCheckUtils]: 11: Hoare triple {172#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172#false} is VALID [2022-04-27 11:08:21,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} ~cond := #in~cond; {172#false} is VALID [2022-04-27 11:08:21,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} assume 0 == ~cond; {172#false} is VALID [2022-04-27 11:08:21,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-27 11:08:21,493 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:08:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:21,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629111334] [2022-04-27 11:08:21,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629111334] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:21,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393247171] [2022-04-27 11:08:21,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:21,495 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:08:21,516 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:08:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:21,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:08:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:21,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:21,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2022-04-27 11:08:21,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-27 11:08:21,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 11:08:21,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #61#return; {171#true} is VALID [2022-04-27 11:08:21,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret11 := main(); {171#true} is VALID [2022-04-27 11:08:21,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {176#(= main_~y~0 0)} is VALID [2022-04-27 11:08:21,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:21,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:21,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {207#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:21,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {172#false} is VALID [2022-04-27 11:08:21,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !(~y~0 % 4294967296 > 0); {172#false} is VALID [2022-04-27 11:08:21,780 INFO L272 TraceCheckUtils]: 11: Hoare triple {172#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172#false} is VALID [2022-04-27 11:08:21,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} ~cond := #in~cond; {172#false} is VALID [2022-04-27 11:08:21,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} assume 0 == ~cond; {172#false} is VALID [2022-04-27 11:08:21,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-27 11:08:21,782 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:08:21,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:21,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-27 11:08:21,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} assume 0 == ~cond; {172#false} is VALID [2022-04-27 11:08:21,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} ~cond := #in~cond; {172#false} is VALID [2022-04-27 11:08:21,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {172#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172#false} is VALID [2022-04-27 11:08:21,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !(~y~0 % 4294967296 > 0); {172#false} is VALID [2022-04-27 11:08:21,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {241#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {172#false} is VALID [2022-04-27 11:08:21,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {241#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:08:21,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {245#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {245#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:08:21,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {252#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {245#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:08:21,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {252#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:08:21,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret11 := main(); {171#true} is VALID [2022-04-27 11:08:21,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #61#return; {171#true} is VALID [2022-04-27 11:08:21,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-27 11:08:21,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-27 11:08:21,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2022-04-27 11:08:21,856 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:08:21,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393247171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:21,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:21,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 11:08:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289924139] [2022-04-27 11:08:21,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 15 [2022-04-27 11:08:21,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:21,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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:08:21,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:21,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:08:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:21,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:08:21,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:08:21,873 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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:08:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:22,190 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-27 11:08:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:08:22,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 15 [2022-04-27 11:08:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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:08:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-27 11:08:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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:08:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-27 11:08:22,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2022-04-27 11:08:22,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:22,255 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:08:22,255 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:08:22,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:08:22,257 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:22,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 39 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:08:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:08:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-04-27 11:08:22,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:22,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:22,275 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:22,276 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:22,280 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 11:08:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 11:08:22,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:22,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:22,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:08:22,282 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:08:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:22,284 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 11:08:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 11:08:22,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:22,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:22,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:22,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-27 11:08:22,297 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2022-04-27 11:08:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:22,297 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-27 11:08:22,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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:08:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-27 11:08:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:08:22,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:22,298 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:08:22,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:08:22,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:22,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-27 11:08:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:22,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49471563] [2022-04-27 11:08:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:22,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {462#true} is VALID [2022-04-27 11:08:22,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} assume true; {462#true} is VALID [2022-04-27 11:08:22,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {462#true} {462#true} #61#return; {462#true} is VALID [2022-04-27 11:08:22,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:22,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {462#true} is VALID [2022-04-27 11:08:22,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2022-04-27 11:08:22,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #61#return; {462#true} is VALID [2022-04-27 11:08:22,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret11 := main(); {462#true} is VALID [2022-04-27 11:08:22,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {467#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:08:22,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {468#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-27 11:08:22,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {468#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {469#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-27 11:08:22,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {470#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:22,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {471#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:22,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {471#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:22,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:22,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:22,770 INFO L272 TraceCheckUtils]: 13: Hoare triple {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:08:22,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {474#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:08:22,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {463#false} is VALID [2022-04-27 11:08:22,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-04-27 11:08:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49471563] [2022-04-27 11:08:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49471563] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003644774] [2022-04-27 11:08:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:22,774 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:08:22,775 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:08:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:22,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:08:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:22,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:23,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2022-04-27 11:08:23,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {462#true} is VALID [2022-04-27 11:08:23,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2022-04-27 11:08:23,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #61#return; {462#true} is VALID [2022-04-27 11:08:23,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret11 := main(); {462#true} is VALID [2022-04-27 11:08:23,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {467#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:08:23,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {497#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:08:23,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {501#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:08:23,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {501#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} ~z~0 := ~y~0; {505#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:08:23,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {509#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:08:23,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {509#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {509#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-27 11:08:23,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {509#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {505#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:08:23,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {505#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {505#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:08:23,163 INFO L272 TraceCheckUtils]: 13: Hoare triple {505#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {522#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:23,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {522#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {526#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:23,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {526#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {463#false} is VALID [2022-04-27 11:08:23,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-04-27 11:08:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:23,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:23,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {463#false} assume !false; {463#false} is VALID [2022-04-27 11:08:23,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {526#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {463#false} is VALID [2022-04-27 11:08:23,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {522#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {526#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:23,660 INFO L272 TraceCheckUtils]: 13: Hoare triple {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {522#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:23,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:23,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {548#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:23,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {548#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:23,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {548#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:23,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {559#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {555#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:08:23,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {559#(or (not (< 0 (mod main_~y~0 4294967296))) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:08:23,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {567#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {563#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:08:23,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {567#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:08:23,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret11 := main(); {462#true} is VALID [2022-04-27 11:08:23,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #61#return; {462#true} is VALID [2022-04-27 11:08:23,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2022-04-27 11:08:23,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {462#true} is VALID [2022-04-27 11:08:23,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2022-04-27 11:08:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:23,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003644774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:23,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:23,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-04-27 11:08:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285860601] [2022-04-27 11:08:23,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:23,670 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:08:23,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:23,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:23,709 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:08:23,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:08:23,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:08:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:08:23,710 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:25,686 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 11:08:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 11:08:25,686 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:08:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 71 transitions. [2022-04-27 11:08:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 71 transitions. [2022-04-27 11:08:25,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 71 transitions. [2022-04-27 11:08:25,988 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:08:25,989 INFO L225 Difference]: With dead ends: 56 [2022-04-27 11:08:25,989 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 11:08:25,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=388, Invalid=1868, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 11:08:25,991 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:25,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 77 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:08:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 11:08:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2022-04-27 11:08:26,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:26,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:26,026 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:26,026 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:26,028 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-27 11:08:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-27 11:08:26,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:26,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:26,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 11:08:26,029 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 11:08:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:26,030 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-04-27 11:08:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-27 11:08:26,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:26,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:26,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:26,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-04-27 11:08:26,036 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 17 [2022-04-27 11:08:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:26,037 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-04-27 11:08:26,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 19 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-27 11:08:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:08:26,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:26,037 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:26,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:08:26,257 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,SelfDestructingSolverStorable2 [2022-04-27 11:08:26,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2041345421, now seen corresponding path program 2 times [2022-04-27 11:08:26,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:26,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941188682] [2022-04-27 11:08:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:26,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:26,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {844#true} is VALID [2022-04-27 11:08:26,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-27 11:08:26,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #61#return; {844#true} is VALID [2022-04-27 11:08:26,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:26,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {844#true} is VALID [2022-04-27 11:08:26,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-27 11:08:26,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #61#return; {844#true} is VALID [2022-04-27 11:08:26,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret11 := main(); {844#true} is VALID [2022-04-27 11:08:26,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {849#(= main_~y~0 0)} is VALID [2022-04-27 11:08:26,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {850#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:26,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {851#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:26,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {852#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:26,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {852#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:26,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:26,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {854#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:08:26,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {845#false} is VALID [2022-04-27 11:08:26,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !(~y~0 % 4294967296 > 0); {845#false} is VALID [2022-04-27 11:08:26,400 INFO L272 TraceCheckUtils]: 14: Hoare triple {845#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {845#false} is VALID [2022-04-27 11:08:26,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2022-04-27 11:08:26,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2022-04-27 11:08:26,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-27 11:08:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:26,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941188682] [2022-04-27 11:08:26,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941188682] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:26,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739245006] [2022-04-27 11:08:26,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:08:26,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:26,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:26,403 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:08:26,429 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:08:26,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:08:26,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:26,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:08:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:26,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:26,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2022-04-27 11:08:26,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {844#true} is VALID [2022-04-27 11:08:26,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-27 11:08:26,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #61#return; {844#true} is VALID [2022-04-27 11:08:26,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret11 := main(); {844#true} is VALID [2022-04-27 11:08:26,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {849#(= main_~y~0 0)} is VALID [2022-04-27 11:08:26,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {850#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:26,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {851#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:26,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {852#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:08:26,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {852#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:26,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:08:26,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {892#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:08:26,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {892#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {845#false} is VALID [2022-04-27 11:08:26,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !(~y~0 % 4294967296 > 0); {845#false} is VALID [2022-04-27 11:08:26,627 INFO L272 TraceCheckUtils]: 14: Hoare triple {845#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {845#false} is VALID [2022-04-27 11:08:26,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2022-04-27 11:08:26,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2022-04-27 11:08:26,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-27 11:08:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:26,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:26,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-04-27 11:08:26,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2022-04-27 11:08:26,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2022-04-27 11:08:26,744 INFO L272 TraceCheckUtils]: 14: Hoare triple {845#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {845#false} is VALID [2022-04-27 11:08:26,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !(~y~0 % 4294967296 > 0); {845#false} is VALID [2022-04-27 11:08:26,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {845#false} is VALID [2022-04-27 11:08:26,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {930#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {926#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:08:26,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {930#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {930#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:08:26,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {937#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {930#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:08:26,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {941#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {937#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:08:26,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {941#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:08:26,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {945#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:08:26,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {844#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {949#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:08:26,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {844#true} call #t~ret11 := main(); {844#true} is VALID [2022-04-27 11:08:26,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {844#true} {844#true} #61#return; {844#true} is VALID [2022-04-27 11:08:26,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {844#true} assume true; {844#true} is VALID [2022-04-27 11:08:26,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {844#true} is VALID [2022-04-27 11:08:26,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2022-04-27 11:08:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:26,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739245006] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:26,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:26,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 11:08:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339779612] [2022-04-27 11:08:26,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 18 [2022-04-27 11:08:26,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:26,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08:26,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:26,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:08:26,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:08:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:08:26,771 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:27,965 INFO L93 Difference]: Finished difference Result 78 states and 119 transitions. [2022-04-27 11:08:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 11:08:27,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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 18 [2022-04-27 11:08:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-27 11:08:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 110 transitions. [2022-04-27 11:08:27,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 110 transitions. [2022-04-27 11:08:28,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:28,083 INFO L225 Difference]: With dead ends: 78 [2022-04-27 11:08:28,083 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 11:08:28,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=1091, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 11:08:28,084 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 154 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:28,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 53 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:08:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 11:08:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 44. [2022-04-27 11:08:28,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:28,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,157 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,157 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:28,159 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-04-27 11:08:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2022-04-27 11:08:28,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:28,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:28,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-27 11:08:28,160 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-27 11:08:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:28,162 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-04-27 11:08:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2022-04-27 11:08:28,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:28,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:28,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:28,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-27 11:08:28,164 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 18 [2022-04-27 11:08:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:28,164 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-04-27 11:08:28,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 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:08:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 11:08:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:08:28,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:28,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:28,181 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:08:28,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:28,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 2 times [2022-04-27 11:08:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:28,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622430774] [2022-04-27 11:08:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:28,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {1359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1349#true} is VALID [2022-04-27 11:08:28,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {1349#true} assume true; {1349#true} is VALID [2022-04-27 11:08:28,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1349#true} {1349#true} #61#return; {1349#true} is VALID [2022-04-27 11:08:28,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {1349#true} call ULTIMATE.init(); {1359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:28,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1349#true} is VALID [2022-04-27 11:08:28,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#true} assume true; {1349#true} is VALID [2022-04-27 11:08:28,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1349#true} {1349#true} #61#return; {1349#true} is VALID [2022-04-27 11:08:28,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {1349#true} call #t~ret11 := main(); {1349#true} is VALID [2022-04-27 11:08:28,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {1349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1354#(= main_~y~0 0)} is VALID [2022-04-27 11:08:28,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {1354#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:28,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:28,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:28,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1357#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:08:28,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {1357#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1358#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:08:28,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1358#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1350#false} is VALID [2022-04-27 11:08:28,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {1350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1350#false} is VALID [2022-04-27 11:08:28,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {1350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1350#false} is VALID [2022-04-27 11:08:28,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1350#false} assume !(~y~0 % 4294967296 > 0); {1350#false} is VALID [2022-04-27 11:08:28,504 INFO L272 TraceCheckUtils]: 15: Hoare triple {1350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1350#false} is VALID [2022-04-27 11:08:28,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1350#false} ~cond := #in~cond; {1350#false} is VALID [2022-04-27 11:08:28,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1350#false} assume 0 == ~cond; {1350#false} is VALID [2022-04-27 11:08:28,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {1350#false} assume !false; {1350#false} is VALID [2022-04-27 11:08:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:08:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:28,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622430774] [2022-04-27 11:08:28,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622430774] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:28,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453361153] [2022-04-27 11:08:28,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:08:28,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:28,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:28,506 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:08:28,507 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:08:28,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:08:28,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:28,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:08:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:28,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:28,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {1349#true} call ULTIMATE.init(); {1349#true} is VALID [2022-04-27 11:08:28,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {1349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1349#true} is VALID [2022-04-27 11:08:28,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#true} assume true; {1349#true} is VALID [2022-04-27 11:08:28,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1349#true} {1349#true} #61#return; {1349#true} is VALID [2022-04-27 11:08:28,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {1349#true} call #t~ret11 := main(); {1349#true} is VALID [2022-04-27 11:08:28,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {1349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1354#(= main_~y~0 0)} is VALID [2022-04-27 11:08:28,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {1354#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:28,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:28,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:28,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1390#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:28,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1394#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:08:28,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {1350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {1350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {1350#false} assume !(~y~0 % 4294967296 > 0); {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L272 TraceCheckUtils]: 15: Hoare triple {1350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {1350#false} ~cond := #in~cond; {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {1350#false} assume 0 == ~cond; {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {1350#false} assume !false; {1350#false} is VALID [2022-04-27 11:08:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:08:28,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:28,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {1350#false} assume !false; {1350#false} is VALID [2022-04-27 11:08:28,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {1350#false} assume 0 == ~cond; {1350#false} is VALID [2022-04-27 11:08:28,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {1350#false} ~cond := #in~cond; {1350#false} is VALID [2022-04-27 11:08:28,730 INFO L272 TraceCheckUtils]: 15: Hoare triple {1350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1350#false} is VALID [2022-04-27 11:08:28,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {1350#false} assume !(~y~0 % 4294967296 > 0); {1350#false} is VALID [2022-04-27 11:08:28,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {1434#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1350#false} is VALID [2022-04-27 11:08:28,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {1438#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1434#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:08:28,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {1442#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1438#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:08:28,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1442#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:08:28,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1349#true} ~z~0 := ~y~0; {1446#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:08:28,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1349#true} assume !(~x~0 % 4294967296 > 0); {1349#true} is VALID [2022-04-27 11:08:28,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1349#true} is VALID [2022-04-27 11:08:28,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {1349#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1349#true} is VALID [2022-04-27 11:08:28,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {1349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1349#true} is VALID [2022-04-27 11:08:28,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {1349#true} call #t~ret11 := main(); {1349#true} is VALID [2022-04-27 11:08:28,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1349#true} {1349#true} #61#return; {1349#true} is VALID [2022-04-27 11:08:28,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#true} assume true; {1349#true} is VALID [2022-04-27 11:08:28,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1349#true} is VALID [2022-04-27 11:08:28,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1349#true} call ULTIMATE.init(); {1349#true} is VALID [2022-04-27 11:08:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:08:28,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453361153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:28,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:28,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-27 11:08:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315448343] [2022-04-27 11:08:28,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:28,735 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (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 19 [2022-04-27 11:08:28,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:28,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (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:08:28,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:28,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:08:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:08:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:08:28,755 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (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:08:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:29,339 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-04-27 11:08:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:08:29,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (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 19 [2022-04-27 11:08:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (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:08:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-27 11:08:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (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:08:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-27 11:08:29,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2022-04-27 11:08:29,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:29,385 INFO L225 Difference]: With dead ends: 72 [2022-04-27 11:08:29,385 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 11:08:29,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2022-04-27 11:08:29,386 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:08:29,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 54 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:08:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 11:08:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-04-27 11:08:29,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:08:29,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 51 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:29,506 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 51 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:29,507 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 51 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:29,508 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2022-04-27 11:08:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-04-27 11:08:29,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:29,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:29,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 11:08:29,509 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 11:08:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:29,510 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2022-04-27 11:08:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-04-27 11:08:29,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:08:29,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:08:29,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:08:29,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:08:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 46 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 11:08:29,512 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 19 [2022-04-27 11:08:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:08:29,512 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 11:08:29,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (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:08:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 11:08:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:08:29,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:08:29,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:08:29,545 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:08:29,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:29,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:08:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:08:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 3 times [2022-04-27 11:08:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:08:29,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199022608] [2022-04-27 11:08:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:08:29,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:08:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:08:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:30,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {1838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1823#true} is VALID [2022-04-27 11:08:30,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-04-27 11:08:30,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1823#true} {1823#true} #61#return; {1823#true} is VALID [2022-04-27 11:08:30,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {1823#true} call ULTIMATE.init(); {1838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:08:30,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1823#true} is VALID [2022-04-27 11:08:30,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-04-27 11:08:30,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1823#true} {1823#true} #61#return; {1823#true} is VALID [2022-04-27 11:08:30,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {1823#true} call #t~ret11 := main(); {1823#true} is VALID [2022-04-27 11:08:30,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1823#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1828#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:08:30,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {1828#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1829#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:08:30,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1830#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-27 11:08:30,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {1830#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {1831#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:30,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {1831#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:08:30,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:08:30,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:08:30,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:08:30,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:08:30,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:30,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:30,216 INFO L272 TraceCheckUtils]: 16: Hoare triple {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1836#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:08:30,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {1836#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1837#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:08:30,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1824#false} is VALID [2022-04-27 11:08:30,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2022-04-27 11:08:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:08:30,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199022608] [2022-04-27 11:08:30,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199022608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:08:30,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551621138] [2022-04-27 11:08:30,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:08:30,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:08:30,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:08:30,218 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:08:30,220 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:08:30,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:08:30,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:08:30,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:08:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:08:30,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:08:55,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {1823#true} call ULTIMATE.init(); {1823#true} is VALID [2022-04-27 11:08:55,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {1823#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1823#true} is VALID [2022-04-27 11:08:55,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-04-27 11:08:55,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1823#true} {1823#true} #61#return; {1823#true} is VALID [2022-04-27 11:08:55,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {1823#true} call #t~ret11 := main(); {1823#true} is VALID [2022-04-27 11:08:55,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {1823#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1828#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:08:55,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {1828#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1860#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:08:55,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {1860#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1864#(and (= (+ (- 2) main_~y~0) 0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-27 11:08:55,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {1864#(and (= (+ (- 2) main_~y~0) 0) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {1831#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:08:55,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {1831#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:08:55,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:08:55,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:08:55,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-27 11:08:55,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {1834#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-27 11:08:55,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {1833#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:08:55,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:08:55,622 INFO L272 TraceCheckUtils]: 16: Hoare triple {1832#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:55,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1896#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:55,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1824#false} is VALID [2022-04-27 11:08:55,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2022-04-27 11:08:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:55,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:08:56,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2022-04-27 11:08:56,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1824#false} is VALID [2022-04-27 11:08:56,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1896#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:08:56,153 INFO L272 TraceCheckUtils]: 16: Hoare triple {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1892#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:08:56,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:56,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {1918#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:56,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {1922#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1918#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:56,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {1922#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {1922#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:08:56,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1922#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:08:56,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1918#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:56,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {1935#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {1835#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:08:56,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {1939#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {1935#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:08:56,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {1943#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1939#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:08:56,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {1947#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1943#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:08:56,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {1823#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1947#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:08:56,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {1823#true} call #t~ret11 := main(); {1823#true} is VALID [2022-04-27 11:08:56,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1823#true} {1823#true} #61#return; {1823#true} is VALID [2022-04-27 11:08:56,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-04-27 11:08:56,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {1823#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1823#true} is VALID [2022-04-27 11:08:56,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {1823#true} call ULTIMATE.init(); {1823#true} is VALID [2022-04-27 11:08:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:08:56,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551621138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:08:56,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:08:56,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2022-04-27 11:08:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569484743] [2022-04-27 11:08:56,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:08:56,163 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:08:56,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:08:56,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:56,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:08:56,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 11:08:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:08:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 11:08:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:08:56,215 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:08:59,289 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2022-04-27 11:08:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 11:08:59,290 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:08:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:08:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-27 11:08:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:08:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-27 11:08:59,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2022-04-27 11:09:00,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:00,566 INFO L225 Difference]: With dead ends: 93 [2022-04-27 11:09:00,566 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 11:09:00,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=311, Invalid=1945, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 11:09:00,567 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:00,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 75 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:09:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 11:09:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-04-27 11:09:00,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:00,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 3 states have call successors, (3), 3 states 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:09:00,695 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 3 states have call successors, (3), 3 states 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:09:00,696 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 3 states have call successors, (3), 3 states 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:09:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:00,697 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2022-04-27 11:09:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-04-27 11:09:00,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:00,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:00,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 11:09:00,698 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 11:09:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:00,699 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2022-04-27 11:09:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-04-27 11:09:00,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:00,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:00,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:00,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 3 states have call successors, (3), 3 states 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:09:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-04-27 11:09:00,700 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 20 [2022-04-27 11:09:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:00,701 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-04-27 11:09:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 11:09:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:09:00,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:00,701 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:00,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:00,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:00,902 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 4 times [2022-04-27 11:09:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:00,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092012224] [2022-04-27 11:09:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:01,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2381#true} is VALID [2022-04-27 11:09:01,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {2381#true} assume true; {2381#true} is VALID [2022-04-27 11:09:01,047 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2381#true} {2381#true} #61#return; {2381#true} is VALID [2022-04-27 11:09:01,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {2381#true} call ULTIMATE.init(); {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:01,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {2393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2381#true} is VALID [2022-04-27 11:09:01,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {2381#true} assume true; {2381#true} is VALID [2022-04-27 11:09:01,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2381#true} {2381#true} #61#return; {2381#true} is VALID [2022-04-27 11:09:01,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {2381#true} call #t~ret11 := main(); {2381#true} is VALID [2022-04-27 11:09:01,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {2381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2386#(= main_~y~0 0)} is VALID [2022-04-27 11:09:01,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {2386#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2387#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:01,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {2387#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2388#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:01,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {2388#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:01,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:01,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2390#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:01,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {2390#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:01,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {2391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2392#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {2392#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {2382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {2382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {2382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {2382#false} assume !(~y~0 % 4294967296 > 0); {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L272 TraceCheckUtils]: 18: Hoare triple {2382#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {2382#false} ~cond := #in~cond; {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#false} assume 0 == ~cond; {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#false} assume !false; {2382#false} is VALID [2022-04-27 11:09:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:01,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092012224] [2022-04-27 11:09:01,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092012224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:01,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820406910] [2022-04-27 11:09:01,055 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:09:01,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:01,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:01,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:01,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:09:01,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:09:01,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:01,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:09:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:01,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:01,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {2381#true} call ULTIMATE.init(); {2381#true} is VALID [2022-04-27 11:09:01,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2381#true} is VALID [2022-04-27 11:09:01,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2381#true} assume true; {2381#true} is VALID [2022-04-27 11:09:01,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2381#true} {2381#true} #61#return; {2381#true} is VALID [2022-04-27 11:09:01,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {2381#true} call #t~ret11 := main(); {2381#true} is VALID [2022-04-27 11:09:01,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {2381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2386#(= main_~y~0 0)} is VALID [2022-04-27 11:09:01,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {2386#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2387#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:01,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {2387#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2388#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:01,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {2388#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:01,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:01,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2427#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:01,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {2427#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2431#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:01,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {2431#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2435#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:09:01,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {2435#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {2382#false} is VALID [2022-04-27 11:09:01,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {2382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2382#false} is VALID [2022-04-27 11:09:01,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {2382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2382#false} is VALID [2022-04-27 11:09:01,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {2382#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2382#false} is VALID [2022-04-27 11:09:01,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {2382#false} assume !(~y~0 % 4294967296 > 0); {2382#false} is VALID [2022-04-27 11:09:01,264 INFO L272 TraceCheckUtils]: 18: Hoare triple {2382#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2382#false} is VALID [2022-04-27 11:09:01,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {2382#false} ~cond := #in~cond; {2382#false} is VALID [2022-04-27 11:09:01,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#false} assume 0 == ~cond; {2382#false} is VALID [2022-04-27 11:09:01,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#false} assume !false; {2382#false} is VALID [2022-04-27 11:09:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:01,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:01,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#false} assume !false; {2382#false} is VALID [2022-04-27 11:09:01,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#false} assume 0 == ~cond; {2382#false} is VALID [2022-04-27 11:09:01,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {2382#false} ~cond := #in~cond; {2382#false} is VALID [2022-04-27 11:09:01,408 INFO L272 TraceCheckUtils]: 18: Hoare triple {2382#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2382#false} is VALID [2022-04-27 11:09:01,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {2382#false} assume !(~y~0 % 4294967296 > 0); {2382#false} is VALID [2022-04-27 11:09:01,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {2478#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2382#false} is VALID [2022-04-27 11:09:01,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {2482#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2478#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:01,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {2486#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2482#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:01,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {2490#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2486#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:01,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2490#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:09:01,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {2498#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2494#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {2381#true} ~z~0 := ~y~0; {2498#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {2381#true} assume !(~x~0 % 4294967296 > 0); {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {2381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {2381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {2381#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {2381#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {2381#true} call #t~ret11 := main(); {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2381#true} {2381#true} #61#return; {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {2381#true} assume true; {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {2381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2381#true} is VALID [2022-04-27 11:09:01,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {2381#true} call ULTIMATE.init(); {2381#true} is VALID [2022-04-27 11:09:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:01,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820406910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:01,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:01,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-27 11:09:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96920490] [2022-04-27 11:09:01,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:01,414 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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 22 [2022-04-27 11:09:01,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:01,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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:09:01,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:01,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:09:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:01,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:09:01,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:09:01,440 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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:09:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:02,564 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2022-04-27 11:09:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 11:09:02,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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 22 [2022-04-27 11:09:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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:09:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-27 11:09:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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:09:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 61 transitions. [2022-04-27 11:09:02,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 61 transitions. [2022-04-27 11:09:02,623 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:09:02,624 INFO L225 Difference]: With dead ends: 84 [2022-04-27 11:09:02,624 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 11:09:02,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=1117, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 11:09:02,625 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:02,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:09:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 11:09:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2022-04-27 11:09:02,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:02,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:02,798 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:02,798 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:02,814 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-27 11:09:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-04-27 11:09:02,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:02,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:02,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 11:09:02,815 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 11:09:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:02,816 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-27 11:09:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-04-27 11:09:02,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:02,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:02,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:02,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-04-27 11:09:02,818 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 22 [2022-04-27 11:09:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:02,818 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-04-27 11:09:02,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 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:09:02,818 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 11:09:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:09:02,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:02,819 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:02,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:03,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:03,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 310755198, now seen corresponding path program 5 times [2022-04-27 11:09:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681392372] [2022-04-27 11:09:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:03,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:03,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {2946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-27 11:09:03,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-27 11:09:03,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2932#true} {2932#true} #61#return; {2932#true} is VALID [2022-04-27 11:09:03,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:03,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-27 11:09:03,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-27 11:09:03,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #61#return; {2932#true} is VALID [2022-04-27 11:09:03,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret11 := main(); {2932#true} is VALID [2022-04-27 11:09:03,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2937#(= main_~y~0 0)} is VALID [2022-04-27 11:09:03,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {2937#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:03,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:03,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {2939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:03,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {2940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:03,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {2941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:03,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:03,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:03,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {2944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:09:03,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2945#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:09:03,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {2945#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2933#false} is VALID [2022-04-27 11:09:03,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {2933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2933#false} is VALID [2022-04-27 11:09:03,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {2933#false} assume !(~y~0 % 4294967296 > 0); {2933#false} is VALID [2022-04-27 11:09:03,157 INFO L272 TraceCheckUtils]: 18: Hoare triple {2933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2933#false} is VALID [2022-04-27 11:09:03,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-27 11:09:03,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-27 11:09:03,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-27 11:09:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:03,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681392372] [2022-04-27 11:09:03,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681392372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085842848] [2022-04-27 11:09:03,158 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:09:03,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:03,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:03,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 11:09:03,199 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:09:03,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:03,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:09:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:03,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:03,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-27 11:09:03,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-27 11:09:03,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-27 11:09:03,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #61#return; {2932#true} is VALID [2022-04-27 11:09:03,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret11 := main(); {2932#true} is VALID [2022-04-27 11:09:03,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2937#(= main_~y~0 0)} is VALID [2022-04-27 11:09:03,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {2937#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:03,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:03,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {2939#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:03,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {2940#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:03,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {2941#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:03,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {2942#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:03,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:03,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {2943#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {2944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:09:03,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2992#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:03,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2933#false} is VALID [2022-04-27 11:09:03,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {2933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2933#false} is VALID [2022-04-27 11:09:03,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {2933#false} assume !(~y~0 % 4294967296 > 0); {2933#false} is VALID [2022-04-27 11:09:03,405 INFO L272 TraceCheckUtils]: 18: Hoare triple {2933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2933#false} is VALID [2022-04-27 11:09:03,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-27 11:09:03,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-27 11:09:03,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-27 11:09:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:03,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:03,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-27 11:09:03,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {2933#false} assume 0 == ~cond; {2933#false} is VALID [2022-04-27 11:09:03,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2933#false} ~cond := #in~cond; {2933#false} is VALID [2022-04-27 11:09:03,588 INFO L272 TraceCheckUtils]: 18: Hoare triple {2933#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2933#false} is VALID [2022-04-27 11:09:03,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {2933#false} assume !(~y~0 % 4294967296 > 0); {2933#false} is VALID [2022-04-27 11:09:03,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {2933#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2933#false} is VALID [2022-04-27 11:09:03,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {3032#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2933#false} is VALID [2022-04-27 11:09:03,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {3036#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3032#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:09:03,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {3040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {3036#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:03,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {3040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:03,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:03,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {3051#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3047#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:03,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {3055#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3051#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:09:03,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {3059#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3055#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:09:03,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {3063#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3059#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:09:03,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {3067#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3063#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:09:03,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3067#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:03,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret11 := main(); {2932#true} is VALID [2022-04-27 11:09:03,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #61#return; {2932#true} is VALID [2022-04-27 11:09:03,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-27 11:09:03,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-27 11:09:03,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-27 11:09:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:03,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085842848] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:03,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:03,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-27 11:09:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785886304] [2022-04-27 11:09:03,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:03,595 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (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 22 [2022-04-27 11:09:03,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:03,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (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:09:03,619 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:09:03,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:09:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:09:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:09:03,619 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (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:09:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:09,717 INFO L93 Difference]: Finished difference Result 154 states and 223 transitions. [2022-04-27 11:09:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-27 11:09:09,717 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (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 22 [2022-04-27 11:09:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (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:09:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 169 transitions. [2022-04-27 11:09:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (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:09:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 169 transitions. [2022-04-27 11:09:09,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 169 transitions. [2022-04-27 11:09:10,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:10,132 INFO L225 Difference]: With dead ends: 154 [2022-04-27 11:09:10,132 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 11:09:10,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1701, Invalid=5271, Unknown=0, NotChecked=0, Total=6972 [2022-04-27 11:09:10,134 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 257 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:10,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 76 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:09:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 11:09:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 76. [2022-04-27 11:09:10,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:10,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:09:10,410 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:09:10,411 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:09:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:10,413 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2022-04-27 11:09:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-04-27 11:09:10,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:10,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:10,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 11:09:10,414 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 11:09:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:10,416 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2022-04-27 11:09:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2022-04-27 11:09:10,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:10,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:10,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:10,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:09:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2022-04-27 11:09:10,418 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 22 [2022-04-27 11:09:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:10,418 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2022-04-27 11:09:10,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 21 states have internal predecessors, (32), 2 states have call successors, (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:09:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2022-04-27 11:09:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:09:10,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:10,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:10,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:10,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:10,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:10,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 6 times [2022-04-27 11:09:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:10,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579971515] [2022-04-27 11:09:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:11,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {3877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-27 11:09:11,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-27 11:09:11,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3860#true} {3860#true} #61#return; {3860#true} is VALID [2022-04-27 11:09:11,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:11,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {3877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-27 11:09:11,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-27 11:09:11,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #61#return; {3860#true} is VALID [2022-04-27 11:09:11,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret11 := main(); {3860#true} is VALID [2022-04-27 11:09:11,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3865#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:09:11,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {3865#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3866#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:11,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {3866#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3867#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:09:11,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {3867#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3868#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-27 11:09:11,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {3868#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 3) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {3869#(and (<= main_~y~0 3) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-27 11:09:11,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {3869#(and (<= main_~y~0 3) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 3) main_~n~0))} ~z~0 := ~y~0; {3870#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-27 11:09:11,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {3870#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3871#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:09:11,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {3871#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3872#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID [2022-04-27 11:09:11,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {3872#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:09:11,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:09:11,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3872#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID [2022-04-27 11:09:11,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {3872#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3871#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:09:11,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {3871#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:11,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:11,058 INFO L272 TraceCheckUtils]: 19: Hoare triple {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3875#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:11,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {3875#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3876#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:11,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {3876#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3861#false} is VALID [2022-04-27 11:09:11,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-27 11:09:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579971515] [2022-04-27 11:09:11,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579971515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134201933] [2022-04-27 11:09:11,059 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:09:11,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:11,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:11,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:11,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 11:09:11,121 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:09:11,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:11,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-27 11:09:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:11,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:35,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3860#true} is VALID [2022-04-27 11:09:35,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-27 11:09:35,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-27 11:09:35,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #61#return; {3860#true} is VALID [2022-04-27 11:09:35,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret11 := main(); {3860#true} is VALID [2022-04-27 11:09:35,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3865#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:09:35,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {3865#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3899#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-27 11:09:35,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {3899#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3903#(and (= (+ (- 2) main_~y~0) 0) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:09:35,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {3903#(and (= (+ (- 2) main_~y~0) 0) (= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3907#(and (= (+ main_~x~0 3) main_~n~0) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 11:09:35,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {3907#(and (= (+ main_~x~0 3) main_~n~0) (= (+ main_~y~0 (- 3)) 0))} assume !(~x~0 % 4294967296 > 0); {3911#(and (= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= (+ main_~y~0 (- 3)) 0))} is VALID [2022-04-27 11:09:35,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {3911#(and (= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= (+ main_~y~0 (- 3)) 0))} ~z~0 := ~y~0; {3915#(and (= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= 0 (+ main_~z~0 (- 3))))} is VALID [2022-04-27 11:09:35,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {3915#(and (= (+ main_~x~0 3) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (= 0 (+ main_~z~0 (- 3))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3919#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:09:35,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {3919#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3923#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:09:35,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {3923#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:09:35,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:09:35,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {3873#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3872#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID [2022-04-27 11:09:35,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {3872#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3871#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:09:35,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {3871#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3870#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-27 11:09:35,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {3870#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {3870#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-27 11:09:35,058 INFO L272 TraceCheckUtils]: 19: Hoare triple {3870#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:35,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:35,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {3949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3861#false} is VALID [2022-04-27 11:09:35,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-27 11:09:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:35,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:35,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-27 11:09:35,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {3949#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3861#false} is VALID [2022-04-27 11:09:35,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3949#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:35,916 INFO L272 TraceCheckUtils]: 19: Hoare triple {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3945#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:35,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:35,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {3971#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:35,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {3975#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3971#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:35,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {3979#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3975#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:09:35,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {3979#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3979#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:35,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {3975#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3979#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:35,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {3971#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3975#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:09:35,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3971#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:35,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {3995#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {3874#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:35,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {3999#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {3995#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:09:35,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {4003#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3999#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:09:35,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {4007#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4003#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:09:35,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {4011#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4007#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:35,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4011#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:35,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret11 := main(); {3860#true} is VALID [2022-04-27 11:09:35,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #61#return; {3860#true} is VALID [2022-04-27 11:09:35,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-27 11:09:35,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-27 11:09:35,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3860#true} is VALID [2022-04-27 11:09:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:35,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134201933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:35,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:35,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 32 [2022-04-27 11:09:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467184695] [2022-04-27 11:09:35,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.40625) internal successors, (45), 29 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:09:35,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:35,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.40625) internal successors, (45), 29 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:36,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:36,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-27 11:09:36,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-27 11:09:36,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2022-04-27 11:09:36,477 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 29 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:41,046 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2022-04-27 11:09:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-27 11:09:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.40625) internal successors, (45), 29 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 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:09:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 29 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 77 transitions. [2022-04-27 11:09:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.40625) internal successors, (45), 29 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 77 transitions. [2022-04-27 11:09:41,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 77 transitions. [2022-04-27 11:09:41,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:41,253 INFO L225 Difference]: With dead ends: 126 [2022-04-27 11:09:41,253 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 11:09:41,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=456, Invalid=3450, Unknown=0, NotChecked=0, Total=3906 [2022-04-27 11:09:41,254 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 68 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:41,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 76 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:09:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 11:09:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2022-04-27 11:09:41,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:41,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states 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:09:41,534 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states 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:09:41,534 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states 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:09:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:41,536 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2022-04-27 11:09:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2022-04-27 11:09:41,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:41,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:41,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-27 11:09:41,537 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-27 11:09:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:41,538 INFO L93 Difference]: Finished difference Result 98 states and 129 transitions. [2022-04-27 11:09:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2022-04-27 11:09:41,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:41,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:41,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:41,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 3 states have call successors, (3), 3 states 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:09:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2022-04-27 11:09:41,540 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 100 transitions. Word has length 23 [2022-04-27 11:09:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:41,540 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 100 transitions. [2022-04-27 11:09:41,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.40625) internal successors, (45), 29 states have internal predecessors, (45), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 100 transitions. [2022-04-27 11:09:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:09:41,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:41,541 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:41,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:41,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 11:09:41,741 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 7 times [2022-04-27 11:09:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995744054] [2022-04-27 11:09:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:41,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:41,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {4622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4608#true} is VALID [2022-04-27 11:09:41,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {4608#true} assume true; {4608#true} is VALID [2022-04-27 11:09:41,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4608#true} {4608#true} #61#return; {4608#true} is VALID [2022-04-27 11:09:41,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {4608#true} call ULTIMATE.init(); {4622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:41,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4608#true} is VALID [2022-04-27 11:09:41,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {4608#true} assume true; {4608#true} is VALID [2022-04-27 11:09:41,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4608#true} {4608#true} #61#return; {4608#true} is VALID [2022-04-27 11:09:41,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {4608#true} call #t~ret11 := main(); {4608#true} is VALID [2022-04-27 11:09:41,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {4608#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4613#(= main_~y~0 0)} is VALID [2022-04-27 11:09:41,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {4613#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4614#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:41,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {4614#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4615#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:41,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {4615#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4616#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:41,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {4616#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:41,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:41,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {4618#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:41,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {4618#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4619#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:41,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {4619#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4620#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:41,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {4620#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4621#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:41,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {4621#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4609#false} is VALID [2022-04-27 11:09:41,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:41,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {4609#false} assume !(~y~0 % 4294967296 > 0); {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L272 TraceCheckUtils]: 21: Hoare triple {4609#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {4609#false} ~cond := #in~cond; {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {4609#false} assume 0 == ~cond; {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {4609#false} assume !false; {4609#false} is VALID [2022-04-27 11:09:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:41,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995744054] [2022-04-27 11:09:41,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995744054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:41,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807738447] [2022-04-27 11:09:41,900 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:09:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:41,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:41,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:41,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 11:09:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:41,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:09:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:41,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:42,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {4608#true} call ULTIMATE.init(); {4608#true} is VALID [2022-04-27 11:09:42,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {4608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4608#true} is VALID [2022-04-27 11:09:42,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {4608#true} assume true; {4608#true} is VALID [2022-04-27 11:09:42,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4608#true} {4608#true} #61#return; {4608#true} is VALID [2022-04-27 11:09:42,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {4608#true} call #t~ret11 := main(); {4608#true} is VALID [2022-04-27 11:09:42,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {4608#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4613#(= main_~y~0 0)} is VALID [2022-04-27 11:09:42,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {4613#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4614#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:42,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {4614#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4615#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:42,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {4615#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4616#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:42,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {4616#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:42,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:42,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {4617#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {4659#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:42,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {4659#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4663#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:42,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {4663#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4667#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:42,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {4667#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4671#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {4671#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {4609#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {4609#false} assume !(~y~0 % 4294967296 > 0); {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L272 TraceCheckUtils]: 21: Hoare triple {4609#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {4609#false} ~cond := #in~cond; {4609#false} is VALID [2022-04-27 11:09:42,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {4609#false} assume 0 == ~cond; {4609#false} is VALID [2022-04-27 11:09:42,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {4609#false} assume !false; {4609#false} is VALID [2022-04-27 11:09:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:42,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:42,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {4609#false} assume !false; {4609#false} is VALID [2022-04-27 11:09:42,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {4609#false} assume 0 == ~cond; {4609#false} is VALID [2022-04-27 11:09:42,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {4609#false} ~cond := #in~cond; {4609#false} is VALID [2022-04-27 11:09:42,333 INFO L272 TraceCheckUtils]: 21: Hoare triple {4609#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4609#false} is VALID [2022-04-27 11:09:42,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {4609#false} assume !(~y~0 % 4294967296 > 0); {4609#false} is VALID [2022-04-27 11:09:42,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {4717#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4609#false} is VALID [2022-04-27 11:09:42,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {4721#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4717#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:42,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {4725#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4721#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:42,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {4729#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4725#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:42,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {4733#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4729#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:42,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {4737#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4733#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:09:42,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {4741#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4737#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:42,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {4745#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4741#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:09:42,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {4608#true} ~z~0 := ~y~0; {4745#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:42,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {4608#true} assume !(~x~0 % 4294967296 > 0); {4608#true} is VALID [2022-04-27 11:09:42,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {4608#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {4608#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {4608#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {4608#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {4608#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {4608#true} call #t~ret11 := main(); {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4608#true} {4608#true} #61#return; {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {4608#true} assume true; {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {4608#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {4608#true} call ULTIMATE.init(); {4608#true} is VALID [2022-04-27 11:09:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:42,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807738447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:42,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:42,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-27 11:09:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017657845] [2022-04-27 11:09:42,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:42,341 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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 25 [2022-04-27 11:09:42,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:42,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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:09:42,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:42,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 11:09:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 11:09:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:09:42,371 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. Second operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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:09:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:44,072 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2022-04-27 11:09:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-27 11:09:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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 25 [2022-04-27 11:09:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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:09:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 70 transitions. [2022-04-27 11:09:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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:09:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 70 transitions. [2022-04-27 11:09:44,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 70 transitions. [2022-04-27 11:09:44,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:44,139 INFO L225 Difference]: With dead ends: 119 [2022-04-27 11:09:44,139 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 11:09:44,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=304, Invalid=1858, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 11:09:44,140 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:44,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 84 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:09:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 11:09:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2022-04-27 11:09:44,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:44,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 82 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 3 states have call successors, (3), 3 states 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:09:44,487 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 82 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 3 states have call successors, (3), 3 states 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:09:44,487 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 82 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 3 states have call successors, (3), 3 states 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:09:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:44,488 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2022-04-27 11:09:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2022-04-27 11:09:44,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:44,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:44,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-27 11:09:44,489 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 100 states. [2022-04-27 11:09:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:44,490 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2022-04-27 11:09:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2022-04-27 11:09:44,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:44,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:44,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:44,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 3 states have call successors, (3), 3 states 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:09:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2022-04-27 11:09:44,492 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 25 [2022-04-27 11:09:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:44,492 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2022-04-27 11:09:44,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 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:09:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2022-04-27 11:09:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:09:44,492 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:44,493 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:44,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 11:09:44,703 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 8 times [2022-04-27 11:09:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430724378] [2022-04-27 11:09:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:45,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:45,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {5377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5358#true} is VALID [2022-04-27 11:09:45,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-27 11:09:45,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5358#true} {5358#true} #61#return; {5358#true} is VALID [2022-04-27 11:09:45,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {5358#true} call ULTIMATE.init(); {5377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:45,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {5377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5358#true} is VALID [2022-04-27 11:09:45,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-27 11:09:45,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5358#true} {5358#true} #61#return; {5358#true} is VALID [2022-04-27 11:09:45,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {5358#true} call #t~ret11 := main(); {5358#true} is VALID [2022-04-27 11:09:45,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {5358#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5363#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:09:45,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {5363#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5364#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:45,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {5364#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5365#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:09:45,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {5365#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5366#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:45,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {5366#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:45,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {5367#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5368#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} is VALID [2022-04-27 11:09:45,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {5368#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} ~z~0 := ~y~0; {5369#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:45,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {5369#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5370#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {5370#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5371#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {5371#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5372#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {5372#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5372#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {5372#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5371#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {5371#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5370#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:09:45,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {5370#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:45,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:09:45,116 INFO L272 TraceCheckUtils]: 22: Hoare triple {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5375#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:45,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {5375#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5376#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:45,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {5376#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5359#false} is VALID [2022-04-27 11:09:45,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {5359#false} assume !false; {5359#false} is VALID [2022-04-27 11:09:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:45,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:45,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430724378] [2022-04-27 11:09:45,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430724378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:45,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967460493] [2022-04-27 11:09:45,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:09:45,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:45,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:45,118 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:45,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 11:09:45,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:09:45,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:45,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 11:09:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:45,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:10:12,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {5358#true} call ULTIMATE.init(); {5358#true} is VALID [2022-04-27 11:10:12,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {5358#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5358#true} is VALID [2022-04-27 11:10:12,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-27 11:10:12,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5358#true} {5358#true} #61#return; {5358#true} is VALID [2022-04-27 11:10:12,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {5358#true} call #t~ret11 := main(); {5358#true} is VALID [2022-04-27 11:10:12,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {5358#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5363#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:10:12,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {5363#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5364#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:12,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {5364#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5365#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:10:12,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {5365#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5405#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:12,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {5405#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5409#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:10:12,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {5409#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {5413#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:10:12,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {5413#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} ~z~0 := ~y~0; {5417#(and (<= 4 main_~z~0) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:10:12,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {5417#(and (<= 4 main_~z~0) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967291)) (<= main_~z~0 4) (not (< 0 (mod main_~x~0 4294967296))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5421#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= 3 main_~z~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:10:12,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {5421#(and (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967292)) (<= main_~z~0 3) (<= 3 main_~z~0) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5425#(and (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:10:12,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {5425#(and (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~z~0 2) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5429#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 1 main_~z~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:10:12,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {5429#(and (<= main_~z~0 1) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~x~0 (+ 4294967294 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 1 main_~z~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:10:12,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:10:12,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5372#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:10:12,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {5372#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5371#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID [2022-04-27 11:10:12,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {5371#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5370#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-27 11:10:12,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {5370#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5369#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:10:12,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {5369#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {5369#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:10:12,452 INFO L272 TraceCheckUtils]: 22: Hoare triple {5369#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:10:12,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {5454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:10:12,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {5458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5359#false} is VALID [2022-04-27 11:10:12,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {5359#false} assume !false; {5359#false} is VALID [2022-04-27 11:10:12,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:12,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:10:13,693 INFO L290 TraceCheckUtils]: 25: Hoare triple {5359#false} assume !false; {5359#false} is VALID [2022-04-27 11:10:13,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {5458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5359#false} is VALID [2022-04-27 11:10:13,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {5454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:10:13,694 INFO L272 TraceCheckUtils]: 22: Hoare triple {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:10:13,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:13,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {5480#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:13,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {5484#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5480#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:13,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {5488#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5484#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:10:13,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {5492#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5488#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:13,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {5492#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {5492#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:10:13,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {5488#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5492#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:10:13,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {5484#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5488#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:13,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {5480#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5484#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:10:13,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5480#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:13,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {5511#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {5374#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:10:13,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {5515#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {5511#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:10:13,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {5519#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5515#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:10:13,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {5523#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5519#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:10:13,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {5527#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5523#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:10:13,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {5531#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5527#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:10:13,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {5358#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5531#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:10:13,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {5358#true} call #t~ret11 := main(); {5358#true} is VALID [2022-04-27 11:10:13,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5358#true} {5358#true} #61#return; {5358#true} is VALID [2022-04-27 11:10:13,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-27 11:10:13,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {5358#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5358#true} is VALID [2022-04-27 11:10:13,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {5358#true} call ULTIMATE.init(); {5358#true} is VALID [2022-04-27 11:10:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:13,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967460493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:10:13,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:10:13,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 15] total 36 [2022-04-27 11:10:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145224304] [2022-04-27 11:10:13,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:10:13,711 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:10:13,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:10:13,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:13,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:13,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 11:10:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:10:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 11:10:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:10:13,804 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:34,656 INFO L93 Difference]: Finished difference Result 140 states and 178 transitions. [2022-04-27 11:10:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-27 11:10:34,656 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:10:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:10:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 89 transitions. [2022-04-27 11:10:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 89 transitions. [2022-04-27 11:10:34,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 89 transitions. [2022-04-27 11:10:35,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:35,346 INFO L225 Difference]: With dead ends: 140 [2022-04-27 11:10:35,346 INFO L226 Difference]: Without dead ends: 105 [2022-04-27 11:10:35,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1230 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=583, Invalid=4819, Unknown=0, NotChecked=0, Total=5402 [2022-04-27 11:10:35,348 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 83 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:10:35,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 123 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 11:10:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-27 11:10:35,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2022-04-27 11:10:35,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:10:35,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:10:35,675 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:10:35,675 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:10:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:35,677 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2022-04-27 11:10:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-04-27 11:10:35,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:35,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:35,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-27 11:10:35,678 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-27 11:10:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:35,679 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2022-04-27 11:10:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-04-27 11:10:35,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:35,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:35,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:10:35,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:10:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 3 states have call successors, (3), 3 states 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:10:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2022-04-27 11:10:35,681 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 26 [2022-04-27 11:10:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:10:35,681 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2022-04-27 11:10:35,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 33 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2022-04-27 11:10:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:10:35,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:10:35,681 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:10:35,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 11:10:35,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 11:10:35,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:10:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:10:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1955077522, now seen corresponding path program 9 times [2022-04-27 11:10:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:10:35,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521463095] [2022-04-27 11:10:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:10:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:10:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:10:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:36,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {6198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6180#true} is VALID [2022-04-27 11:10:36,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-27 11:10:36,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6180#true} {6180#true} #61#return; {6180#true} is VALID [2022-04-27 11:10:36,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:10:36,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {6198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6180#true} is VALID [2022-04-27 11:10:36,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-27 11:10:36,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #61#return; {6180#true} is VALID [2022-04-27 11:10:36,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret11 := main(); {6180#true} is VALID [2022-04-27 11:10:36,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {6180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6185#(= main_~y~0 0)} is VALID [2022-04-27 11:10:36,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {6185#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6186#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:36,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {6186#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6187#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:10:36,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {6187#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6188#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:10:36,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {6188#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6189#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:10:36,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {6189#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:10:36,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6191#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:10:36,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {6191#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6192#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:36,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {6192#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {6192#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:36,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {6192#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {6193#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:10:36,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {6193#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6194#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:10:36,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {6194#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6195#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:10:36,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {6195#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6196#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:10:36,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {6196#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6197#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:10:36,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {6197#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {6181#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {6181#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {6181#false} assume !(~y~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L272 TraceCheckUtils]: 23: Hoare triple {6181#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-27 11:10:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:10:36,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:10:36,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521463095] [2022-04-27 11:10:36,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521463095] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:10:36,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299469354] [2022-04-27 11:10:36,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:10:36,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:10:36,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:10:36,099 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:10:36,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 11:10:36,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:10:36,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:10:36,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:10:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:36,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:10:36,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6180#true} is VALID [2022-04-27 11:10:36,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {6180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6180#true} is VALID [2022-04-27 11:10:36,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-27 11:10:36,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #61#return; {6180#true} is VALID [2022-04-27 11:10:36,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret11 := main(); {6180#true} is VALID [2022-04-27 11:10:36,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {6180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6180#true} is VALID [2022-04-27 11:10:36,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {6180#true} assume !(~x~0 % 4294967296 > 0); {6180#true} is VALID [2022-04-27 11:10:36,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {6180#true} ~z~0 := ~y~0; {6244#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:10:36,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {6244#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6248#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:10:36,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {6248#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6252#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-27 11:10:36,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {6252#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:36,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:36,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:36,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6266#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:10:36,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {6266#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6270#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:10:36,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-27 11:10:36,302 INFO L272 TraceCheckUtils]: 23: Hoare triple {6181#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6181#false} is VALID [2022-04-27 11:10:36,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-27 11:10:36,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-27 11:10:36,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-27 11:10:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:10:36,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:10:36,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-27 11:10:36,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-27 11:10:36,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-27 11:10:36,453 INFO L272 TraceCheckUtils]: 23: Hoare triple {6181#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6181#false} is VALID [2022-04-27 11:10:36,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {6270#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-27 11:10:36,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {6266#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6270#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:10:36,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6266#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:10:36,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:36,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:36,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {6313#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6256#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:36,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {6317#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6313#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {6321#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6317#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {6180#true} ~z~0 := ~y~0; {6321#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {6180#true} assume !(~x~0 % 4294967296 > 0); {6180#true} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {6180#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {6180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret11 := main(); {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #61#return; {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {6180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6180#true} is VALID [2022-04-27 11:10:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:10:36,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299469354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:10:36,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:10:36,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 25 [2022-04-27 11:10:36,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742539876] [2022-04-27 11:10:36,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:10:36,460 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 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 27 [2022-04-27 11:10:36,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:10:36,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 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:10:36,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:36,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:10:36,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:10:36,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:10:36,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:10:36,490 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 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:10:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:38,869 INFO L93 Difference]: Finished difference Result 128 states and 172 transitions. [2022-04-27 11:10:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-27 11:10:38,869 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 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 27 [2022-04-27 11:10:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:10:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 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:10:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 106 transitions. [2022-04-27 11:10:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 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:10:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 106 transitions. [2022-04-27 11:10:38,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 106 transitions. [2022-04-27 11:10:38,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:38,954 INFO L225 Difference]: With dead ends: 128 [2022-04-27 11:10:38,955 INFO L226 Difference]: Without dead ends: 114 [2022-04-27 11:10:38,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=649, Invalid=3011, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 11:10:38,956 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 126 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:10:38,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 69 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:10:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-27 11:10:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2022-04-27 11:10:39,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:10:39,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states 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:10:39,197 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states 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:10:39,197 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states 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:10:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:39,199 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2022-04-27 11:10:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2022-04-27 11:10:39,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:39,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:39,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-27 11:10:39,199 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 114 states. [2022-04-27 11:10:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:39,201 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2022-04-27 11:10:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2022-04-27 11:10:39,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:39,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:39,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:10:39,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:10:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 3 states have call successors, (3), 3 states 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:10:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-04-27 11:10:39,202 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 27 [2022-04-27 11:10:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:10:39,202 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-04-27 11:10:39,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.56) internal successors, (39), 24 states have internal predecessors, (39), 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:10:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-27 11:10:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:10:39,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:10:39,203 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:10:39,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 11:10:39,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 11:10:39,417 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:10:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:10:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 867538926, now seen corresponding path program 3 times [2022-04-27 11:10:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:10:39,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617595733] [2022-04-27 11:10:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:10:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:10:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:10:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:39,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {7028#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7008#true} is VALID [2022-04-27 11:10:39,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {7008#true} assume true; {7008#true} is VALID [2022-04-27 11:10:39,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7008#true} {7008#true} #61#return; {7008#true} is VALID [2022-04-27 11:10:39,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {7008#true} call ULTIMATE.init(); {7028#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:10:39,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {7028#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7008#true} is VALID [2022-04-27 11:10:39,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {7008#true} assume true; {7008#true} is VALID [2022-04-27 11:10:39,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7008#true} {7008#true} #61#return; {7008#true} is VALID [2022-04-27 11:10:39,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {7008#true} call #t~ret11 := main(); {7008#true} is VALID [2022-04-27 11:10:39,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {7008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7013#(= main_~y~0 0)} is VALID [2022-04-27 11:10:39,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {7013#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7014#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:39,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {7014#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7015#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:10:39,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {7015#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7016#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:10:39,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {7016#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7017#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:10:39,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {7017#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7018#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:10:39,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {7018#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7019#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:10:39,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {7019#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7020#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:39,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {7020#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7021#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:10:39,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {7021#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7022#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:39,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {7022#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7023#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:10:39,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {7023#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7024#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:10:39,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {7024#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7025#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:10:39,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {7025#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:10:39,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:10:39,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {7027#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:10:39,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {7027#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7009#false} is VALID [2022-04-27 11:10:39,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {7009#false} assume !(~y~0 % 4294967296 > 0); {7009#false} is VALID [2022-04-27 11:10:39,673 INFO L272 TraceCheckUtils]: 23: Hoare triple {7009#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7009#false} is VALID [2022-04-27 11:10:39,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {7009#false} ~cond := #in~cond; {7009#false} is VALID [2022-04-27 11:10:39,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {7009#false} assume 0 == ~cond; {7009#false} is VALID [2022-04-27 11:10:39,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {7009#false} assume !false; {7009#false} is VALID [2022-04-27 11:10:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:39,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:10:39,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617595733] [2022-04-27 11:10:39,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617595733] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:10:39,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473966135] [2022-04-27 11:10:39,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:10:39,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:10:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:10:39,675 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:10:39,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 11:10:39,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-27 11:10:39,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:10:39,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 11:10:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:39,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:10:40,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {7008#true} call ULTIMATE.init(); {7008#true} is VALID [2022-04-27 11:10:40,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {7008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7008#true} is VALID [2022-04-27 11:10:40,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {7008#true} assume true; {7008#true} is VALID [2022-04-27 11:10:40,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7008#true} {7008#true} #61#return; {7008#true} is VALID [2022-04-27 11:10:40,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {7008#true} call #t~ret11 := main(); {7008#true} is VALID [2022-04-27 11:10:40,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {7008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7013#(= main_~y~0 0)} is VALID [2022-04-27 11:10:40,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {7013#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7014#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:40,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {7014#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7015#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:10:40,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {7015#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7016#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:10:40,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {7016#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7017#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:10:40,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {7017#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7018#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:10:40,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {7018#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7019#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:10:40,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {7019#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7020#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:40,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {7020#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7021#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:10:40,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {7021#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7022#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:40,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {7022#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7023#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:10:40,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {7023#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7024#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:10:40,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {7024#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7025#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:10:40,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {7025#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:10:40,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:10:40,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {7026#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {7092#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:10:40,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {7092#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {7009#false} is VALID [2022-04-27 11:10:40,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {7009#false} assume !(~y~0 % 4294967296 > 0); {7009#false} is VALID [2022-04-27 11:10:40,061 INFO L272 TraceCheckUtils]: 23: Hoare triple {7009#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7009#false} is VALID [2022-04-27 11:10:40,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {7009#false} ~cond := #in~cond; {7009#false} is VALID [2022-04-27 11:10:40,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {7009#false} assume 0 == ~cond; {7009#false} is VALID [2022-04-27 11:10:40,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {7009#false} assume !false; {7009#false} is VALID [2022-04-27 11:10:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:40,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:10:40,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {7009#false} assume !false; {7009#false} is VALID [2022-04-27 11:10:40,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {7009#false} assume 0 == ~cond; {7009#false} is VALID [2022-04-27 11:10:40,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {7009#false} ~cond := #in~cond; {7009#false} is VALID [2022-04-27 11:10:40,435 INFO L272 TraceCheckUtils]: 23: Hoare triple {7009#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7009#false} is VALID [2022-04-27 11:10:40,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {7009#false} assume !(~y~0 % 4294967296 > 0); {7009#false} is VALID [2022-04-27 11:10:40,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {7126#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7009#false} is VALID [2022-04-27 11:10:40,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {7130#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7126#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:10:40,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {7130#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7130#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:10:40,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {7137#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7130#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:10:40,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {7141#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7137#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:10:40,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {7145#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7141#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:10:40,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {7149#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7145#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:10:40,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7149#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:10:40,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {7157#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7153#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:40,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {7161#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7157#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:10:40,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {7165#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7161#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:40,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {7169#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7165#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:10:40,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {7173#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7169#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:10:40,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {7177#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7173#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:10:40,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {7181#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7177#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:10:40,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {7185#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7181#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:10:40,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {7008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7185#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:10:40,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {7008#true} call #t~ret11 := main(); {7008#true} is VALID [2022-04-27 11:10:40,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7008#true} {7008#true} #61#return; {7008#true} is VALID [2022-04-27 11:10:40,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {7008#true} assume true; {7008#true} is VALID [2022-04-27 11:10:40,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {7008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7008#true} is VALID [2022-04-27 11:10:40,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {7008#true} call ULTIMATE.init(); {7008#true} is VALID [2022-04-27 11:10:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:10:40,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473966135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:10:40,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:10:40,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-27 11:10:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248488036] [2022-04-27 11:10:40,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:10:40,444 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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 27 [2022-04-27 11:10:40,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:10:40,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:10:40,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:40,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 11:10:40,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:10:40,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 11:10:40,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:10:40,469 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:11:02,305 WARN L232 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:11:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:46,534 INFO L93 Difference]: Finished difference Result 399 states and 542 transitions. [2022-04-27 11:11:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-27 11:11:46,534 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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 27 [2022-04-27 11:11:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:11:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 249 transitions. [2022-04-27 11:11:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:11:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 249 transitions. [2022-04-27 11:11:46,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 249 transitions. [2022-04-27 11:11:46,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:46,990 INFO L225 Difference]: With dead ends: 399 [2022-04-27 11:11:46,990 INFO L226 Difference]: Without dead ends: 371 [2022-04-27 11:11:46,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2586 ImplicationChecksByTransitivity, 59.8s TimeCoverageRelationStatistics Valid=2476, Invalid=7226, Unknown=0, NotChecked=0, Total=9702 [2022-04-27 11:11:46,993 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 901 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:46,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 105 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 11:11:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-04-27 11:11:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 122. [2022-04-27 11:11:47,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:47,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 122 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:47,667 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 122 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:47,667 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 122 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:47,673 INFO L93 Difference]: Finished difference Result 371 states and 478 transitions. [2022-04-27 11:11:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 478 transitions. [2022-04-27 11:11:47,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:47,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:47,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 371 states. [2022-04-27 11:11:47,674 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 371 states. [2022-04-27 11:11:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:47,679 INFO L93 Difference]: Finished difference Result 371 states and 478 transitions. [2022-04-27 11:11:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 478 transitions. [2022-04-27 11:11:47,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:47,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:47,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:47,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:11:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 161 transitions. [2022-04-27 11:11:47,681 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 161 transitions. Word has length 27 [2022-04-27 11:11:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:47,682 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 161 transitions. [2022-04-27 11:11:47,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 33 states have internal predecessors, (43), 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:11:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 161 transitions. [2022-04-27 11:11:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:11:47,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:47,682 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:47,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 11:11:47,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 11:11:47,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 10 times [2022-04-27 11:11:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:47,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97832192] [2022-04-27 11:11:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:48,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {8863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8847#true} is VALID [2022-04-27 11:11:48,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {8847#true} assume true; {8847#true} is VALID [2022-04-27 11:11:48,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8847#true} {8847#true} #61#return; {8847#true} is VALID [2022-04-27 11:11:48,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:48,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {8863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8847#true} is VALID [2022-04-27 11:11:48,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {8847#true} assume true; {8847#true} is VALID [2022-04-27 11:11:48,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8847#true} {8847#true} #61#return; {8847#true} is VALID [2022-04-27 11:11:48,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {8847#true} call #t~ret11 := main(); {8847#true} is VALID [2022-04-27 11:11:48,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {8847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8852#(= main_~y~0 0)} is VALID [2022-04-27 11:11:48,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {8852#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8853#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:48,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8854#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:48,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {8854#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8855#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:11:48,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {8855#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8856#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:48,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {8856#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8858#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:11:48,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {8858#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8859#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:11:48,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {8859#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8860#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:11:48,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {8860#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8861#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:11:48,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {8861#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8862#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {8862#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {8848#false} assume !(~y~0 % 4294967296 > 0); {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L272 TraceCheckUtils]: 24: Hoare triple {8848#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {8848#false} ~cond := #in~cond; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {8848#false} assume 0 == ~cond; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2022-04-27 11:11:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:11:48,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:48,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97832192] [2022-04-27 11:11:48,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97832192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:48,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176317988] [2022-04-27 11:11:48,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:11:48,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:48,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:11:48,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 11:11:48,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:11:48,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:48,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 11:11:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:48,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:11:48,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8847#true} is VALID [2022-04-27 11:11:48,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {8847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8847#true} is VALID [2022-04-27 11:11:48,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {8847#true} assume true; {8847#true} is VALID [2022-04-27 11:11:48,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8847#true} {8847#true} #61#return; {8847#true} is VALID [2022-04-27 11:11:48,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {8847#true} call #t~ret11 := main(); {8847#true} is VALID [2022-04-27 11:11:48,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {8847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8852#(= main_~y~0 0)} is VALID [2022-04-27 11:11:48,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {8852#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8853#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:48,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8854#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:11:48,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {8854#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8855#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:11:48,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {8855#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8856#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:11:48,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {8856#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {8857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8903#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {8903#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8907#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:11:48,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {8907#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8911#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {8911#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8915#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {8915#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8919#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {8919#(and (<= 5 main_~y~0) (= main_~y~0 (+ main_~z~0 4)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {8848#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {8848#false} assume !(~y~0 % 4294967296 > 0); {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L272 TraceCheckUtils]: 24: Hoare triple {8848#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {8848#false} ~cond := #in~cond; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {8848#false} assume 0 == ~cond; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2022-04-27 11:11:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:11:48,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:48,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {8848#false} assume !false; {8848#false} is VALID [2022-04-27 11:11:48,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {8848#false} assume 0 == ~cond; {8848#false} is VALID [2022-04-27 11:11:48,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {8848#false} ~cond := #in~cond; {8848#false} is VALID [2022-04-27 11:11:48,582 INFO L272 TraceCheckUtils]: 24: Hoare triple {8848#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8848#false} is VALID [2022-04-27 11:11:48,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {8848#false} assume !(~y~0 % 4294967296 > 0); {8848#false} is VALID [2022-04-27 11:11:48,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {8968#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8848#false} is VALID [2022-04-27 11:11:48,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {8972#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8968#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:11:48,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {8976#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8972#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:11:48,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {8980#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8976#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:11:48,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {8984#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8980#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:11:48,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {8988#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8984#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:11:48,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {8992#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8988#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:11:48,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {8996#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8992#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:11:48,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {9000#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8996#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {9004#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9000#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {8847#true} ~z~0 := ~y~0; {9004#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {8847#true} assume !(~x~0 % 4294967296 > 0); {8847#true} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {8847#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#true} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {8847#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#true} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {8847#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#true} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {8847#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#true} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {8847#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#true} is VALID [2022-04-27 11:11:48,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {8847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8847#true} is VALID [2022-04-27 11:11:48,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {8847#true} call #t~ret11 := main(); {8847#true} is VALID [2022-04-27 11:11:48,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8847#true} {8847#true} #61#return; {8847#true} is VALID [2022-04-27 11:11:48,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {8847#true} assume true; {8847#true} is VALID [2022-04-27 11:11:48,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {8847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8847#true} is VALID [2022-04-27 11:11:48,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {8847#true} call ULTIMATE.init(); {8847#true} is VALID [2022-04-27 11:11:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:11:48,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176317988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:48,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:48,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 29 [2022-04-27 11:11:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109236728] [2022-04-27 11:11:48,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:48,607 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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 28 [2022-04-27 11:11:48,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:11:48,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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:11:48,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:48,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 11:11:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:11:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 11:11:48,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:11:48,631 INFO L87 Difference]: Start difference. First operand 122 states and 161 transitions. Second operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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:11:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:50,896 INFO L93 Difference]: Finished difference Result 209 states and 264 transitions. [2022-04-27 11:11:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 11:11:50,897 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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 28 [2022-04-27 11:11:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:11:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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:11:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-27 11:11:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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:11:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 76 transitions. [2022-04-27 11:11:50,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 76 transitions. [2022-04-27 11:11:50,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:11:50,981 INFO L225 Difference]: With dead ends: 209 [2022-04-27 11:11:50,981 INFO L226 Difference]: Without dead ends: 159 [2022-04-27 11:11:50,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=2787, Unknown=0, NotChecked=0, Total=3192 [2022-04-27 11:11:50,983 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:11:50,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:11:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-27 11:11:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2022-04-27 11:11:51,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:11:51,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 136 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 3 states have call successors, (3), 3 states 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:11:51,893 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 136 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 3 states have call successors, (3), 3 states 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:11:51,893 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 136 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 3 states have call successors, (3), 3 states 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:11:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:51,895 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2022-04-27 11:11:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 200 transitions. [2022-04-27 11:11:51,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:51,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:51,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-27 11:11:51,896 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-27 11:11:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:11:51,897 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2022-04-27 11:11:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 200 transitions. [2022-04-27 11:11:51,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:11:51,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:11:51,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:11:51,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:11:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 3 states have call successors, (3), 3 states 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:11:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 177 transitions. [2022-04-27 11:11:51,899 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 177 transitions. Word has length 28 [2022-04-27 11:11:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:11:51,900 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 177 transitions. [2022-04-27 11:11:51,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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:11:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 177 transitions. [2022-04-27 11:11:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:11:51,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:11:51,900 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:11:51,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 11:11:52,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 11:11:52,111 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:11:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:11:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 11 times [2022-04-27 11:11:52,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:11:52,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315906156] [2022-04-27 11:11:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:11:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:11:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:52,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:11:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:52,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {9998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9977#true} is VALID [2022-04-27 11:11:52,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {9977#true} assume true; {9977#true} is VALID [2022-04-27 11:11:52,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9977#true} {9977#true} #61#return; {9977#true} is VALID [2022-04-27 11:11:52,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {9977#true} call ULTIMATE.init(); {9998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:11:52,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {9998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9977#true} is VALID [2022-04-27 11:11:52,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {9977#true} assume true; {9977#true} is VALID [2022-04-27 11:11:52,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9977#true} {9977#true} #61#return; {9977#true} is VALID [2022-04-27 11:11:52,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {9977#true} call #t~ret11 := main(); {9977#true} is VALID [2022-04-27 11:11:52,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {9977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9982#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:11:52,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {9982#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9983#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:11:52,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {9983#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9984#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:11:52,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {9984#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9985#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:11:52,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {9985#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9986#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:11:53,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {9986#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9987#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 5) main_~n~0) (<= 5 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 5))} is VALID [2022-04-27 11:11:53,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {9987#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 5) main_~n~0) (<= 5 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9988#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-27 11:11:53,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {9988#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} ~z~0 := ~y~0; {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-27 11:11:53,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-27 11:11:53,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-27 11:11:53,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:11:53,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:11:53,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:11:53,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:11:53,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:11:53,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:11:53,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-27 11:11:53,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-27 11:11:53,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:11:53,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:11:53,188 INFO L272 TraceCheckUtils]: 25: Hoare triple {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9996#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:11:53,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {9996#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9997#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:11:53,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {9997#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9978#false} is VALID [2022-04-27 11:11:53,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {9978#false} assume !false; {9978#false} is VALID [2022-04-27 11:11:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:11:53,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:11:53,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315906156] [2022-04-27 11:11:53,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315906156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:11:53,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986052697] [2022-04-27 11:11:53,189 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:11:53,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:11:53,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:11:53,192 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:11:53,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 11:11:53,411 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:11:53,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:11:53,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-27 11:11:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:11:53,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:21,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {9977#true} call ULTIMATE.init(); {9977#true} is VALID [2022-04-27 11:12:21,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {9977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9977#true} is VALID [2022-04-27 11:12:21,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {9977#true} assume true; {9977#true} is VALID [2022-04-27 11:12:21,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9977#true} {9977#true} #61#return; {9977#true} is VALID [2022-04-27 11:12:21,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {9977#true} call #t~ret11 := main(); {9977#true} is VALID [2022-04-27 11:12:21,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {9977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9982#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:12:21,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {9982#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9983#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:21,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {9983#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10023#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 11:12:21,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {10023#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10027#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:21,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {10027#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10031#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:12:21,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {10031#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10035#(and (<= 5 main_~y~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:12:21,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {10035#(and (<= 5 main_~y~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9988#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-27 11:12:21,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {9988#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} ~z~0 := ~y~0; {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-27 11:12:21,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-27 11:12:21,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-27 11:12:21,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:12:21,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:12:21,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:12:21,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:12:21,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {9994#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:12:21,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {9993#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-27 11:12:21,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {9992#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-27 11:12:21,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {9991#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-27 11:12:21,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {9990#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-27 11:12:21,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !(~y~0 % 4294967296 > 0); {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-27 11:12:21,394 INFO L272 TraceCheckUtils]: 25: Hoare triple {9989#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10081#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:12:21,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {10081#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10085#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:12:21,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {10085#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9978#false} is VALID [2022-04-27 11:12:21,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {9978#false} assume !false; {9978#false} is VALID [2022-04-27 11:12:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:12:21,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:26,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {9978#false} assume !false; {9978#false} is VALID [2022-04-27 11:12:26,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {10085#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9978#false} is VALID [2022-04-27 11:12:26,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {10081#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10085#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:12:26,231 INFO L272 TraceCheckUtils]: 25: Hoare triple {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10081#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:12:26,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {10107#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {10111#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10107#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {10115#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10111#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:12:26,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {10119#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10115#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {10123#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10119#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:12:26,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {10123#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {10123#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {10119#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10123#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {10115#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10119#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:12:26,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {10111#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10115#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {10107#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10111#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:12:26,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10107#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {10145#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {9995#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:12:26,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {10149#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {10145#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:12:26,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {10153#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10149#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:12:26,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {10157#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10153#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:12:26,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {10161#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10157#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:12:26,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {10165#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10161#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:12:26,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {10169#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10165#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:12:26,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {9977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10169#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:12:26,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {9977#true} call #t~ret11 := main(); {9977#true} is VALID [2022-04-27 11:12:26,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9977#true} {9977#true} #61#return; {9977#true} is VALID [2022-04-27 11:12:26,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {9977#true} assume true; {9977#true} is VALID [2022-04-27 11:12:26,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {9977#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9977#true} is VALID [2022-04-27 11:12:26,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {9977#true} call ULTIMATE.init(); {9977#true} is VALID [2022-04-27 11:12:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:12:26,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986052697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:26,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:26,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 37 [2022-04-27 11:12:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141331238] [2022-04-27 11:12:26,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 34 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:12:26,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:26,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 34 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:26,380 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:12:26,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 11:12:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 11:12:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1191, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 11:12:26,381 INFO L87 Difference]: Start difference. First operand 136 states and 177 transitions. Second operand has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 34 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:28,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:12:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:54,571 INFO L93 Difference]: Finished difference Result 211 states and 257 transitions. [2022-04-27 11:12:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-27 11:12:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 34 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:12:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:12:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 34 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 84 transitions. [2022-04-27 11:12:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 34 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 84 transitions. [2022-04-27 11:12:54,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 84 transitions. [2022-04-27 11:12:56,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:56,906 INFO L225 Difference]: With dead ends: 211 [2022-04-27 11:12:56,906 INFO L226 Difference]: Without dead ends: 179 [2022-04-27 11:12:56,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=631, Invalid=5530, Unknown=1, NotChecked=0, Total=6162 [2022-04-27 11:12:56,908 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:12:56,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 114 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-27 11:12:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-27 11:12:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 124. [2022-04-27 11:12:57,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:12:57,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 124 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:57,709 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 124 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:57,709 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 124 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:57,711 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2022-04-27 11:12:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2022-04-27 11:12:57,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:57,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:57,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-27 11:12:57,712 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-27 11:12:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:12:57,714 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2022-04-27 11:12:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2022-04-27 11:12:57,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:12:57,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:12:57,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:12:57,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:12:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2022-04-27 11:12:57,716 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 29 [2022-04-27 11:12:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:12:57,716 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-04-27 11:12:57,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 34 states have internal predecessors, (54), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:12:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2022-04-27 11:12:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:12:57,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:12:57,718 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:12:57,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 11:12:57,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:57,921 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:12:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:12:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1363427330, now seen corresponding path program 12 times [2022-04-27 11:12:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:12:57,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392355137] [2022-04-27 11:12:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:12:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:12:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:12:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:58,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {11191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11169#true} is VALID [2022-04-27 11:12:58,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {11169#true} assume true; {11169#true} is VALID [2022-04-27 11:12:58,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11169#true} {11169#true} #61#return; {11169#true} is VALID [2022-04-27 11:12:58,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {11169#true} call ULTIMATE.init(); {11191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:12:58,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {11191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11169#true} is VALID [2022-04-27 11:12:58,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {11169#true} assume true; {11169#true} is VALID [2022-04-27 11:12:58,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11169#true} {11169#true} #61#return; {11169#true} is VALID [2022-04-27 11:12:58,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {11169#true} call #t~ret11 := main(); {11169#true} is VALID [2022-04-27 11:12:58,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {11169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11174#(= main_~y~0 0)} is VALID [2022-04-27 11:12:58,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {11174#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:58,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {11175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:58,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {11176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:58,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {11177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:58,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {11178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:12:58,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {11179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:58,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {11180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:12:58,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {11181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:12:58,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {11182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:12:58,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {11183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:12:58,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {11184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:12:58,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {11185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:12:58,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {11186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11187#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:12:58,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {11187#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:12:58,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:12:58,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {11189#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:12:58,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {11189#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11190#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:12:58,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {11190#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11170#false} is VALID [2022-04-27 11:12:58,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {11170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11170#false} is VALID [2022-04-27 11:12:58,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {11170#false} assume !(~y~0 % 4294967296 > 0); {11170#false} is VALID [2022-04-27 11:12:58,228 INFO L272 TraceCheckUtils]: 26: Hoare triple {11170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11170#false} is VALID [2022-04-27 11:12:58,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {11170#false} ~cond := #in~cond; {11170#false} is VALID [2022-04-27 11:12:58,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {11170#false} assume 0 == ~cond; {11170#false} is VALID [2022-04-27 11:12:58,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {11170#false} assume !false; {11170#false} is VALID [2022-04-27 11:12:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:12:58,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:12:58,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392355137] [2022-04-27 11:12:58,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392355137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:12:58,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319264453] [2022-04-27 11:12:58,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:12:58,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:12:58,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:12:58,230 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:12:58,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 11:12:58,415 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-27 11:12:58,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:12:58,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 11:12:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:12:58,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:12:58,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {11169#true} call ULTIMATE.init(); {11169#true} is VALID [2022-04-27 11:12:58,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {11169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11169#true} is VALID [2022-04-27 11:12:58,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {11169#true} assume true; {11169#true} is VALID [2022-04-27 11:12:58,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11169#true} {11169#true} #61#return; {11169#true} is VALID [2022-04-27 11:12:58,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {11169#true} call #t~ret11 := main(); {11169#true} is VALID [2022-04-27 11:12:58,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {11169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11174#(= main_~y~0 0)} is VALID [2022-04-27 11:12:58,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {11174#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:12:58,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {11175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:12:58,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {11176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:12:58,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {11177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:12:58,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {11178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:12:58,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {11179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:12:58,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {11180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:12:58,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {11181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:12:58,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {11182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:12:58,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {11183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:12:58,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {11184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:12:58,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {11185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:12:58,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {11186#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11187#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:12:58,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {11187#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:12:58,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:12:58,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {11188#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {11189#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:12:58,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {11189#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11261#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:12:58,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {11261#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {11170#false} is VALID [2022-04-27 11:12:58,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {11170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11170#false} is VALID [2022-04-27 11:12:58,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {11170#false} assume !(~y~0 % 4294967296 > 0); {11170#false} is VALID [2022-04-27 11:12:58,725 INFO L272 TraceCheckUtils]: 26: Hoare triple {11170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11170#false} is VALID [2022-04-27 11:12:58,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {11170#false} ~cond := #in~cond; {11170#false} is VALID [2022-04-27 11:12:58,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {11170#false} assume 0 == ~cond; {11170#false} is VALID [2022-04-27 11:12:58,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {11170#false} assume !false; {11170#false} is VALID [2022-04-27 11:12:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:12:58,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:12:59,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {11170#false} assume !false; {11170#false} is VALID [2022-04-27 11:12:59,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {11170#false} assume 0 == ~cond; {11170#false} is VALID [2022-04-27 11:12:59,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {11170#false} ~cond := #in~cond; {11170#false} is VALID [2022-04-27 11:12:59,193 INFO L272 TraceCheckUtils]: 26: Hoare triple {11170#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11170#false} is VALID [2022-04-27 11:12:59,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {11170#false} assume !(~y~0 % 4294967296 > 0); {11170#false} is VALID [2022-04-27 11:12:59,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {11170#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11170#false} is VALID [2022-04-27 11:12:59,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {11301#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11170#false} is VALID [2022-04-27 11:12:59,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {11305#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11301#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:12:59,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {11309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {11305#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:12:59,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {11309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:12:59,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {11316#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:12:59,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {11320#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11316#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:12:59,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {11324#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11320#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:12:59,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {11328#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11324#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:12:59,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {11332#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11328#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:12:59,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {11336#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11332#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:12:59,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {11340#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11336#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:59,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {11344#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11340#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:12:59,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {11348#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11344#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:12:59,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {11352#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11348#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:12:59,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {11356#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11352#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:12:59,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {11360#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11356#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:12:59,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {11364#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11360#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:12:59,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {11368#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11364#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:12:59,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {11169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11368#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:12:59,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {11169#true} call #t~ret11 := main(); {11169#true} is VALID [2022-04-27 11:12:59,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11169#true} {11169#true} #61#return; {11169#true} is VALID [2022-04-27 11:12:59,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {11169#true} assume true; {11169#true} is VALID [2022-04-27 11:12:59,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {11169#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11169#true} is VALID [2022-04-27 11:12:59,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {11169#true} call ULTIMATE.init(); {11169#true} is VALID [2022-04-27 11:12:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:12:59,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319264453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:12:59,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:12:59,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-27 11:12:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428533367] [2022-04-27 11:12:59,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:12:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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 30 [2022-04-27 11:12:59,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:12:59,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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:12:59,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:12:59,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:12:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:12:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:12:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:12:59,237 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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:13:15,388 WARN L232 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:13:37,383 WARN L232 SmtUtils]: Spent 7.24s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:14:00,073 WARN L232 SmtUtils]: Spent 9.36s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:14:22,809 WARN L232 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:14:30,126 WARN L232 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:14:34,497 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ 2 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~z~0) 4294967296)) (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod (+ 11 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~y~0 4294967296)) (< 0 (mod (+ 13 c_main_~y~0) 4294967296)) (< 0 (mod (+ 3 c_main_~y~0) 4294967296)) (< 0 (mod (+ c_main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~y~0) 4294967296)) (< 0 (mod (+ 8 c_main_~y~0) 4294967296)) (< 0 (mod (+ 6 c_main_~y~0) 4294967296)) (< 0 (mod (+ 5 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4 c_main_~y~0) 4294967296)) (< 0 (mod (+ 9 c_main_~y~0) 4294967296)) (< 0 (mod (+ 10 c_main_~y~0) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< 0 (mod (+ 7 c_main_~y~0) 4294967296)) (< 0 (mod (+ 12 c_main_~y~0) 4294967296))) is different from false [2022-04-27 11:15:19,790 WARN L232 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:16:45,844 WARN L232 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:16:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:53,432 INFO L93 Difference]: Finished difference Result 462 states and 609 transitions. [2022-04-27 11:16:53,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2022-04-27 11:16:53,432 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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 30 [2022-04-27 11:16:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:16:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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:16:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 313 transitions. [2022-04-27 11:16:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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:16:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 313 transitions. [2022-04-27 11:16:53,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 313 transitions. [2022-04-27 11:16:56,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:56,009 INFO L225 Difference]: With dead ends: 462 [2022-04-27 11:16:56,009 INFO L226 Difference]: Without dead ends: 444 [2022-04-27 11:16:56,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10610 ImplicationChecksByTransitivity, 217.1s TimeCoverageRelationStatistics Valid=6922, Invalid=21810, Unknown=2, NotChecked=336, Total=29070 [2022-04-27 11:16:56,019 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 835 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 966 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:16:56,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 126 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [966 Valid, 1432 Invalid, 0 Unknown, 1 Unchecked, 6.3s Time] [2022-04-27 11:16:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-04-27 11:16:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 137. [2022-04-27 11:16:56,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:16:56,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 444 states. Second operand has 137 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 3 states have call successors, (3), 3 states 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:16:56,917 INFO L74 IsIncluded]: Start isIncluded. First operand 444 states. Second operand has 137 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 3 states have call successors, (3), 3 states 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:16:56,917 INFO L87 Difference]: Start difference. First operand 444 states. Second operand has 137 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 3 states have call successors, (3), 3 states 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:16:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:56,924 INFO L93 Difference]: Finished difference Result 444 states and 558 transitions. [2022-04-27 11:16:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 558 transitions. [2022-04-27 11:16:56,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:56,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:56,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 444 states. [2022-04-27 11:16:56,925 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 444 states. [2022-04-27 11:16:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:16:56,932 INFO L93 Difference]: Finished difference Result 444 states and 558 transitions. [2022-04-27 11:16:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 558 transitions. [2022-04-27 11:16:56,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:16:56,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:16:56,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:16:56,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:16:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 132 states have internal predecessors, (175), 3 states have call successors, (3), 3 states 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:16:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2022-04-27 11:16:56,935 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 30 [2022-04-27 11:16:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:16:56,935 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2022-04-27 11:16:56,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 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:16:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2022-04-27 11:16:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:16:56,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:16:56,935 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:16:56,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-27 11:16:57,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 11:16:57,140 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:16:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:16:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 13 times [2022-04-27 11:16:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:16:57,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644051689] [2022-04-27 11:16:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:16:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:16:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:16:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:57,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {13451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13433#true} is VALID [2022-04-27 11:16:57,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {13433#true} assume true; {13433#true} is VALID [2022-04-27 11:16:57,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13433#true} {13433#true} #61#return; {13433#true} is VALID [2022-04-27 11:16:57,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {13433#true} call ULTIMATE.init(); {13451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:16:57,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {13451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13433#true} is VALID [2022-04-27 11:16:57,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {13433#true} assume true; {13433#true} is VALID [2022-04-27 11:16:57,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13433#true} {13433#true} #61#return; {13433#true} is VALID [2022-04-27 11:16:57,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {13433#true} call #t~ret11 := main(); {13433#true} is VALID [2022-04-27 11:16:57,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {13433#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13438#(= main_~y~0 0)} is VALID [2022-04-27 11:16:57,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {13438#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13439#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:57,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {13439#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13440#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:57,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {13440#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13441#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:57,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {13441#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13442#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:57,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {13442#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13443#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:57,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {13443#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13445#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:16:57,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {13445#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13446#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:16:57,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {13446#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13447#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:16:57,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {13447#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13448#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:16:57,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {13448#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13449#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:16:57,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {13449#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13450#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:16:57,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {13450#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {13434#false} assume !(~y~0 % 4294967296 > 0); {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L272 TraceCheckUtils]: 27: Hoare triple {13434#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {13434#false} ~cond := #in~cond; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {13434#false} assume 0 == ~cond; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {13434#false} assume !false; {13434#false} is VALID [2022-04-27 11:16:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:16:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:16:57,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644051689] [2022-04-27 11:16:57,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644051689] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:16:57,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798571569] [2022-04-27 11:16:57,342 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:16:57,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:16:57,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:16:57,342 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:16:57,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 11:16:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:57,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 11:16:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:16:57,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:16:57,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {13433#true} call ULTIMATE.init(); {13433#true} is VALID [2022-04-27 11:16:57,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {13433#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13433#true} is VALID [2022-04-27 11:16:57,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {13433#true} assume true; {13433#true} is VALID [2022-04-27 11:16:57,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13433#true} {13433#true} #61#return; {13433#true} is VALID [2022-04-27 11:16:57,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {13433#true} call #t~ret11 := main(); {13433#true} is VALID [2022-04-27 11:16:57,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {13433#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13438#(= main_~y~0 0)} is VALID [2022-04-27 11:16:57,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {13438#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13439#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:16:57,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {13439#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13440#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:16:57,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {13440#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13441#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:16:57,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {13441#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13442#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:16:57,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {13442#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13443#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:16:57,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {13443#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {13444#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13494#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {13494#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13498#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:16:57,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {13498#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13502#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {13502#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13506#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {13506#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13510#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {13510#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13514#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:16:57,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {13514#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {13434#false} is VALID [2022-04-27 11:16:57,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {13434#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:57,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {13434#false} assume !(~y~0 % 4294967296 > 0); {13434#false} is VALID [2022-04-27 11:16:57,653 INFO L272 TraceCheckUtils]: 27: Hoare triple {13434#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13434#false} is VALID [2022-04-27 11:16:57,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {13434#false} ~cond := #in~cond; {13434#false} is VALID [2022-04-27 11:16:57,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {13434#false} assume 0 == ~cond; {13434#false} is VALID [2022-04-27 11:16:57,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {13434#false} assume !false; {13434#false} is VALID [2022-04-27 11:16:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:16:57,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:16:58,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {13434#false} assume !false; {13434#false} is VALID [2022-04-27 11:16:58,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {13434#false} assume 0 == ~cond; {13434#false} is VALID [2022-04-27 11:16:58,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {13434#false} ~cond := #in~cond; {13434#false} is VALID [2022-04-27 11:16:58,013 INFO L272 TraceCheckUtils]: 27: Hoare triple {13434#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13434#false} is VALID [2022-04-27 11:16:58,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {13434#false} assume !(~y~0 % 4294967296 > 0); {13434#false} is VALID [2022-04-27 11:16:58,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {13566#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13434#false} is VALID [2022-04-27 11:16:58,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {13570#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13566#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:16:58,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {13574#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13570#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:16:58,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {13578#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13574#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:16:58,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {13582#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13578#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:16:58,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {13586#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13582#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:16:58,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {13590#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13586#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:16:58,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {13594#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13590#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:16:58,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {13598#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13594#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:16:58,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {13602#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13598#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:16:58,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {13606#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13602#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:16:58,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {13610#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13606#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {13433#true} ~z~0 := ~y~0; {13610#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {13433#true} assume !(~x~0 % 4294967296 > 0); {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {13433#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {13433#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {13433#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {13433#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {13433#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {13433#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {13433#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {13433#true} call #t~ret11 := main(); {13433#true} is VALID [2022-04-27 11:16:58,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13433#true} {13433#true} #61#return; {13433#true} is VALID [2022-04-27 11:16:58,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {13433#true} assume true; {13433#true} is VALID [2022-04-27 11:16:58,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {13433#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13433#true} is VALID [2022-04-27 11:16:58,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {13433#true} call ULTIMATE.init(); {13433#true} is VALID [2022-04-27 11:16:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:16:58,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798571569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:16:58,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:16:58,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 34 [2022-04-27 11:16:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282622198] [2022-04-27 11:16:58,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:16:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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 31 [2022-04-27 11:16:58,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:16:58,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:16:58,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:16:58,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 11:16:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:16:58,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 11:16:58,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:16:58,081 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:17:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:02,362 INFO L93 Difference]: Finished difference Result 242 states and 303 transitions. [2022-04-27 11:17:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 11:17:02,362 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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 31 [2022-04-27 11:17:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:17:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-27 11:17:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:17:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-27 11:17:02,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 85 transitions. [2022-04-27 11:17:02,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:02,516 INFO L225 Difference]: With dead ends: 242 [2022-04-27 11:17:02,516 INFO L226 Difference]: Without dead ends: 179 [2022-04-27 11:17:02,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=518, Invalid=3904, Unknown=0, NotChecked=0, Total=4422 [2022-04-27 11:17:02,517 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:02,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:17:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-27 11:17:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2022-04-27 11:17:03,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:03,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 153 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 3 states have call successors, (3), 3 states 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:17:03,247 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 153 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 3 states have call successors, (3), 3 states 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:17:03,248 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 153 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 3 states have call successors, (3), 3 states 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:17:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:03,254 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2022-04-27 11:17:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2022-04-27 11:17:03,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:03,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:03,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-27 11:17:03,264 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 179 states. [2022-04-27 11:17:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:03,266 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2022-04-27 11:17:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2022-04-27 11:17:03,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:03,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:03,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:03,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.304054054054054) internal successors, (193), 148 states have internal predecessors, (193), 3 states have call successors, (3), 3 states 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:17:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2022-04-27 11:17:03,268 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 31 [2022-04-27 11:17:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:03,268 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2022-04-27 11:17:03,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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:17:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-04-27 11:17:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:17:03,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:03,269 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:03,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 11:17:03,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 11:17:03,489 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 14 times [2022-04-27 11:17:03,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:03,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829100479] [2022-04-27 11:17:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:03,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:04,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {14740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14717#true} is VALID [2022-04-27 11:17:04,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {14717#true} assume true; {14717#true} is VALID [2022-04-27 11:17:04,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14717#true} {14717#true} #61#return; {14717#true} is VALID [2022-04-27 11:17:04,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {14717#true} call ULTIMATE.init(); {14740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:04,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {14740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14717#true} is VALID [2022-04-27 11:17:04,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {14717#true} assume true; {14717#true} is VALID [2022-04-27 11:17:04,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14717#true} {14717#true} #61#return; {14717#true} is VALID [2022-04-27 11:17:04,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {14717#true} call #t~ret11 := main(); {14717#true} is VALID [2022-04-27 11:17:04,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {14717#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:17:04,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {14722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14723#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:04,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {14723#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14724#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:17:04,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {14724#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14725#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:04,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {14725#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14726#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 11:17:04,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {14726#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14727#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:04,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {14727#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14728#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 6) main_~n~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:04,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {14728#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 6) main_~n~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14729#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {14729#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} ~z~0 := ~y~0; {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:04,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:04,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-27 11:17:04,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-27 11:17:04,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:04,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:04,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:04,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:04,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:04,168 INFO L272 TraceCheckUtils]: 28: Hoare triple {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:17:04,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {14738#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14739#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:17:04,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {14739#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14718#false} is VALID [2022-04-27 11:17:04,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {14718#false} assume !false; {14718#false} is VALID [2022-04-27 11:17:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:17:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:04,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829100479] [2022-04-27 11:17:04,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829100479] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:04,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128509895] [2022-04-27 11:17:04,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:17:04,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:04,171 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:04,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 11:17:04,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:17:04,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:04,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-27 11:17:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:04,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:28,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {14717#true} call ULTIMATE.init(); {14717#true} is VALID [2022-04-27 11:17:28,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {14717#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14717#true} is VALID [2022-04-27 11:17:28,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {14717#true} assume true; {14717#true} is VALID [2022-04-27 11:17:28,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14717#true} {14717#true} #61#return; {14717#true} is VALID [2022-04-27 11:17:28,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {14717#true} call #t~ret11 := main(); {14717#true} is VALID [2022-04-27 11:17:28,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {14717#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 11:17:28,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {14722#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14762#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} is VALID [2022-04-27 11:17:28,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {14762#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14766#(and (= main_~y~0 2) (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0))} is VALID [2022-04-27 11:17:28,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {14766#(and (= main_~y~0 2) (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14770#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} is VALID [2022-04-27 11:17:28,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {14770#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14774#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (= main_~y~0 4))} is VALID [2022-04-27 11:17:28,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {14774#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14778#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-27 11:17:28,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {14778#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14782#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (< 0 (mod (+ 4294967291 main_~n~0) 4294967296)) (= (+ (- 2) main_~y~0) 4))} is VALID [2022-04-27 11:17:28,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {14782#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (< 0 (mod (+ 4294967291 main_~n~0) 4294967296)) (= (+ (- 2) main_~y~0) 4))} assume !(~x~0 % 4294967296 > 0); {14729#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {14729#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} ~z~0 := ~y~0; {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:28,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:28,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-27 11:17:28,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {14736#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-27 11:17:28,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {14735#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:28,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {14734#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-27 11:17:28,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {14733#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {14732#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {14731#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-27 11:17:28,416 INFO L272 TraceCheckUtils]: 28: Hoare triple {14730#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14834#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:28,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {14834#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14838#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:28,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {14838#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14718#false} is VALID [2022-04-27 11:17:28,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {14718#false} assume !false; {14718#false} is VALID [2022-04-27 11:17:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:17:28,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:30,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {14718#false} assume !false; {14718#false} is VALID [2022-04-27 11:17:30,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {14838#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14718#false} is VALID [2022-04-27 11:17:30,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {14834#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14838#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:30,406 INFO L272 TraceCheckUtils]: 28: Hoare triple {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14834#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:30,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {14860#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {14864#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14860#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {14868#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14864#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:30,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {14872#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14868#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {14876#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14872#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:30,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {14880#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14876#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {14880#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14880#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:30,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {14876#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14880#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:30,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {14872#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14876#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {14868#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14872#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:30,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {14864#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14868#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {14860#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14864#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:30,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14860#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {14905#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {14737#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:30,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {14909#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {14905#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:30,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {14913#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14909#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 11:17:30,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {14917#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14913#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:17:30,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {14921#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14917#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:17:30,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {14925#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14921#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:17:30,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {14929#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14925#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:30,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {14933#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14929#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 11:17:30,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {14717#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14933#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:17:30,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {14717#true} call #t~ret11 := main(); {14717#true} is VALID [2022-04-27 11:17:30,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14717#true} {14717#true} #61#return; {14717#true} is VALID [2022-04-27 11:17:30,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {14717#true} assume true; {14717#true} is VALID [2022-04-27 11:17:30,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {14717#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14717#true} is VALID [2022-04-27 11:17:30,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {14717#true} call ULTIMATE.init(); {14717#true} is VALID [2022-04-27 11:17:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:17:30,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128509895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:30,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:30,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 43 [2022-04-27 11:17:30,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753540838] [2022-04-27 11:17:30,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:30,428 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:17:30,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:30,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:31,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:31,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-27 11:17:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:31,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-27 11:17:31,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1620, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 11:17:31,008 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:06,777 INFO L93 Difference]: Finished difference Result 246 states and 296 transitions. [2022-04-27 11:18:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-27 11:18:06,777 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:18:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 91 transitions. [2022-04-27 11:18:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 91 transitions. [2022-04-27 11:18:06,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 91 transitions. [2022-04-27 11:18:07,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:07,272 INFO L225 Difference]: With dead ends: 246 [2022-04-27 11:18:07,272 INFO L226 Difference]: Without dead ends: 210 [2022-04-27 11:18:07,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=777, Invalid=7410, Unknown=3, NotChecked=0, Total=8190 [2022-04-27 11:18:07,273 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 98 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:07,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 144 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-27 11:18:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-27 11:18:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 139. [2022-04-27 11:18:08,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:08,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 139 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 3 states have call successors, (3), 3 states 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:18:08,291 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 139 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 3 states have call successors, (3), 3 states 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:18:08,291 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 139 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 3 states have call successors, (3), 3 states 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:18:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:08,295 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2022-04-27 11:18:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2022-04-27 11:18:08,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:08,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:08,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 210 states. [2022-04-27 11:18:08,295 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 210 states. [2022-04-27 11:18:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:08,299 INFO L93 Difference]: Finished difference Result 210 states and 258 transitions. [2022-04-27 11:18:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2022-04-27 11:18:08,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:08,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:08,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:08,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 134 states have internal predecessors, (176), 3 states have call successors, (3), 3 states 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:18:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2022-04-27 11:18:08,301 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 32 [2022-04-27 11:18:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:08,301 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2022-04-27 11:18:08,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2022-04-27 11:18:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:18:08,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:08,302 INFO L195 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:08,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 11:18:08,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:18:08,518 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1705192978, now seen corresponding path program 15 times [2022-04-27 11:18:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:08,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988990710] [2022-04-27 11:18:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:08,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:08,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {16110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16086#true} is VALID [2022-04-27 11:18:08,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {16086#true} assume true; {16086#true} is VALID [2022-04-27 11:18:08,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16086#true} {16086#true} #61#return; {16086#true} is VALID [2022-04-27 11:18:08,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {16086#true} call ULTIMATE.init(); {16110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:08,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {16110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16086#true} is VALID [2022-04-27 11:18:08,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {16086#true} assume true; {16086#true} is VALID [2022-04-27 11:18:08,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16086#true} {16086#true} #61#return; {16086#true} is VALID [2022-04-27 11:18:08,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {16086#true} call #t~ret11 := main(); {16086#true} is VALID [2022-04-27 11:18:08,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {16086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16091#(= main_~y~0 0)} is VALID [2022-04-27 11:18:08,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {16091#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:08,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {16092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:08,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {16093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:08,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {16094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:08,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {16095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:08,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {16096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:08,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {16097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:08,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {16098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:18:08,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {16099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:18:08,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {16100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:18:08,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {16101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:18:08,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {16102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:18:08,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {16103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:18:08,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {16104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:18:08,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {16105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:08,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:08,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {16107#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:08,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {16107#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16108#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:18:08,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {16108#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16109#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:18:08,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {16109#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16087#false} is VALID [2022-04-27 11:18:08,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {16087#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16087#false} is VALID [2022-04-27 11:18:08,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {16087#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16087#false} is VALID [2022-04-27 11:18:08,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {16087#false} assume !(~y~0 % 4294967296 > 0); {16087#false} is VALID [2022-04-27 11:18:08,847 INFO L272 TraceCheckUtils]: 29: Hoare triple {16087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16087#false} is VALID [2022-04-27 11:18:08,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {16087#false} ~cond := #in~cond; {16087#false} is VALID [2022-04-27 11:18:08,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {16087#false} assume 0 == ~cond; {16087#false} is VALID [2022-04-27 11:18:08,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {16087#false} assume !false; {16087#false} is VALID [2022-04-27 11:18:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:18:08,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:08,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988990710] [2022-04-27 11:18:08,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988990710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:08,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625973942] [2022-04-27 11:18:08,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:18:08,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:08,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:08,849 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:08,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 11:18:09,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-27 11:18:09,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:18:09,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 11:18:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:09,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:09,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {16086#true} call ULTIMATE.init(); {16086#true} is VALID [2022-04-27 11:18:09,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {16086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16086#true} is VALID [2022-04-27 11:18:09,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {16086#true} assume true; {16086#true} is VALID [2022-04-27 11:18:09,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16086#true} {16086#true} #61#return; {16086#true} is VALID [2022-04-27 11:18:09,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {16086#true} call #t~ret11 := main(); {16086#true} is VALID [2022-04-27 11:18:09,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {16086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16091#(= main_~y~0 0)} is VALID [2022-04-27 11:18:09,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {16091#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:09,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {16092#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:09,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {16093#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:09,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {16094#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:09,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {16095#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:09,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {16096#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:09,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {16097#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:09,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {16098#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:18:09,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {16099#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:18:09,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {16100#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:18:09,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {16101#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:18:09,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {16102#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:18:09,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {16103#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:18:09,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {16104#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:18:09,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {16105#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:09,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:09,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {16106#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {16107#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:09,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {16107#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16108#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:18:09,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {16108#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16186#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:18:09,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {16186#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {16087#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {16087#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {16087#false} assume !(~y~0 % 4294967296 > 0); {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L272 TraceCheckUtils]: 29: Hoare triple {16087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {16087#false} ~cond := #in~cond; {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {16087#false} assume 0 == ~cond; {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {16087#false} assume !false; {16087#false} is VALID [2022-04-27 11:18:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:18:09,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:10,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {16087#false} assume !false; {16087#false} is VALID [2022-04-27 11:18:10,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {16087#false} assume 0 == ~cond; {16087#false} is VALID [2022-04-27 11:18:10,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {16087#false} ~cond := #in~cond; {16087#false} is VALID [2022-04-27 11:18:10,053 INFO L272 TraceCheckUtils]: 29: Hoare triple {16087#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16087#false} is VALID [2022-04-27 11:18:10,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {16087#false} assume !(~y~0 % 4294967296 > 0); {16087#false} is VALID [2022-04-27 11:18:10,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {16087#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16087#false} is VALID [2022-04-27 11:18:10,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {16087#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16087#false} is VALID [2022-04-27 11:18:10,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {16232#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16087#false} is VALID [2022-04-27 11:18:10,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {16236#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16232#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:10,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {16240#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16236#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:10,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {16244#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {16240#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:18:10,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {16244#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16244#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:18:10,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {16251#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16244#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:18:10,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {16255#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:10,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {16259#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16255#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:18:10,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {16263#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16259#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:18:10,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {16267#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16263#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:18:10,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {16271#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16267#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:18:10,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {16275#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16271#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:18:10,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {16279#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16275#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:10,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {16283#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16279#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:18:10,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {16287#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16283#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:10,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {16291#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16287#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:18:10,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {16295#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16291#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:18:10,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {16299#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16295#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:18:10,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {16303#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16299#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:18:10,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {16307#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16303#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:18:10,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {16086#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16307#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:18:10,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {16086#true} call #t~ret11 := main(); {16086#true} is VALID [2022-04-27 11:18:10,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16086#true} {16086#true} #61#return; {16086#true} is VALID [2022-04-27 11:18:10,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {16086#true} assume true; {16086#true} is VALID [2022-04-27 11:18:10,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {16086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16086#true} is VALID [2022-04-27 11:18:10,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {16086#true} call ULTIMATE.init(); {16086#true} is VALID [2022-04-27 11:18:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:18:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625973942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:10,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:10,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-27 11:18:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457386723] [2022-04-27 11:18:10,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:10,068 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 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 33 [2022-04-27 11:18:10,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:10,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 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:18:10,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:18:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:18:10,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:18:10,097 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 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:18:29,310 WARN L232 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:18:43,783 WARN L232 SmtUtils]: Spent 7.31s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:19:04,657 WARN L232 SmtUtils]: Spent 16.27s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:19:28,386 WARN L232 SmtUtils]: Spent 10.80s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:19:52,327 WARN L232 SmtUtils]: Spent 17.14s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:20:24,081 WARN L232 SmtUtils]: Spent 15.51s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:20:43,053 WARN L232 SmtUtils]: Spent 13.06s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:20:57,846 WARN L232 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:18,545 WARN L232 SmtUtils]: Spent 9.66s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:34,221 WARN L232 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:48,751 WARN L232 SmtUtils]: Spent 10.20s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:10,878 WARN L232 SmtUtils]: Spent 13.49s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:31,778 WARN L232 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:55,479 WARN L232 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)