/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-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:13:04,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:13:04,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:13:04,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:13:04,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:13:04,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:13:04,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:13:04,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:13:04,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:13:04,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:13:04,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:13:04,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:13:04,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:13:04,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:13:04,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:13:04,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:13:04,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:13:04,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:13:04,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:13:04,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:13:04,969 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:13:04,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:13:04,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:13:04,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:13:04,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:13:04,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:13:04,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:13:04,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:13:04,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:13:04,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:13:04,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:13:04,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:13:04,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:13:04,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:13:04,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:13:04,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:13:04,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:13:04,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:13:04,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:13:04,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:13:04,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:13:04,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:13:04,993 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:13:05,020 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:13:05,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:13:05,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:13:05,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:13:05,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:13:05,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:13:05,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:13:05,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:13:05,022 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:13:05,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:13:05,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:13:05,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:13:05,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:13:05,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:13:05,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:13:05,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:13:05,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:13:05,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:13:05,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:13:05,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:13:05,026 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:13:05,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:13:05,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:13:05,026 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:13:05,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:13:05,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:13:05,026 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:13:05,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:13:05,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:13:05,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:13:05,272 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:13:05,272 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:13:05,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-27 11:13:05,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12239541e/39032c6198584a62ac5b23394e987927/FLAGc2d3a9502 [2022-04-27 11:13:05,675 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:13:05,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-27 11:13:05,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12239541e/39032c6198584a62ac5b23394e987927/FLAGc2d3a9502 [2022-04-27 11:13:05,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12239541e/39032c6198584a62ac5b23394e987927 [2022-04-27 11:13:05,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:13:05,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:13:05,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:13:05,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:13:05,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:13:05,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:05,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05, skipping insertion in model container [2022-04-27 11:13:05,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:05,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:13:05,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:13:05,882 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-de51.c[368,381] [2022-04-27 11:13:05,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:13:05,914 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:13:05,929 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-de51.c[368,381] [2022-04-27 11:13:05,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:13:05,980 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:13:05,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05 WrapperNode [2022-04-27 11:13:05,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:13:05,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:13:05,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:13:05,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:13:05,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:05,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:06,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:06,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:06,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:06,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:06,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:06,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:13:06,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:13:06,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:13:06,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:13:06,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (1/1) ... [2022-04-27 11:13:06,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:13:06,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:06,054 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:13:06,055 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:13:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:13:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:13:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:13:06,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:13:06,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:13:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:13:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:13:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:13:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:13:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:13:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:13:06,139 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:13:06,140 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:13:06,307 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:13:06,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:13:06,313 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 11:13:06,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:13:06 BoogieIcfgContainer [2022-04-27 11:13:06,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:13:06,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:13:06,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:13:06,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:13:06,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:13:05" (1/3) ... [2022-04-27 11:13:06,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d2848f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:13:06, skipping insertion in model container [2022-04-27 11:13:06,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:13:05" (2/3) ... [2022-04-27 11:13:06,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d2848f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:13:06, skipping insertion in model container [2022-04-27 11:13:06,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:13:06" (3/3) ... [2022-04-27 11:13:06,349 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-04-27 11:13:06,361 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:13:06,361 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:13:06,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:13:06,402 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@77e505dd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7cdc4d56 [2022-04-27 11:13:06,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:13:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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:13:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:13:06,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:06,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:06,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-27 11:13:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:06,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215409982] [2022-04-27 11:13:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:06,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 11:13:06,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 11:13:06,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-27 11:13:06,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:06,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 11:13:06,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 11:13:06,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-27 11:13:06,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-27 11:13:06,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-27 11:13:06,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-27 11:13:06,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-27 11:13:06,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-27 11:13:06,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-27 11:13:06,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-27 11:13:06,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-27 11:13:06,623 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-27 11:13:06,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 11:13:06,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 11:13:06,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 11:13:06,624 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:13:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:06,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215409982] [2022-04-27 11:13:06,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215409982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:06,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:06,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:13:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857375935] [2022-04-27 11:13:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:06,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:13:06,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:06,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:06,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:13:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:06,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:13:06,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:13:06,687 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:06,782 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-27 11:13:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:13:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:13:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 11:13:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 11:13:06,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-27 11:13:06,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:06,866 INFO L225 Difference]: With dead ends: 41 [2022-04-27 11:13:06,866 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:13:06,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:13:06,872 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:06,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:13:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:13:06,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:06,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,902 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,904 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:06,911 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-27 11:13:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-27 11:13:06,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:06,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:06,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:13:06,913 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:13:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:06,916 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-27 11:13:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-27 11:13:06,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:06,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:06,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:06,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-27 11:13:06,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-27 11:13:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:06,931 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-27 11:13:06,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-27 11:13:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:13:06,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:06,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:06,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:13:06,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:06,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:06,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-27 11:13:06,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:06,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844684863] [2022-04-27 11:13:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:06,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:07,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:07,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146#true} is VALID [2022-04-27 11:13:07,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 11:13:07,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} #83#return; {146#true} is VALID [2022-04-27 11:13:07,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:07,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {146#true} is VALID [2022-04-27 11:13:07,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume true; {146#true} is VALID [2022-04-27 11:13:07,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} #83#return; {146#true} is VALID [2022-04-27 11:13:07,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} call #t~ret15 := main(); {146#true} is VALID [2022-04-27 11:13:07,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:07,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:07,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:07,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:07,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:07,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:07,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:07,138 INFO L272 TraceCheckUtils]: 12: Hoare triple {151#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:07,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {153#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:07,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {147#false} is VALID [2022-04-27 11:13:07,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 11:13:07,139 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:13:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:07,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844684863] [2022-04-27 11:13:07,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844684863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:07,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:07,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:13:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668917307] [2022-04-27 11:13:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:13:07,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:07,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:07,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:13:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:13:07,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:13:07,162 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,336 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-27 11:13:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:13:07,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:13:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-27 11:13:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-27 11:13:07,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-27 11:13:07,375 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:13:07,376 INFO L225 Difference]: With dead ends: 28 [2022-04-27 11:13:07,377 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:13:07,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:13:07,378 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:07,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:07,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:13:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 11:13:07,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:07,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,383 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,383 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,385 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-27 11:13:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-27 11:13:07,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:07,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:07,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:13:07,386 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:13:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,388 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-27 11:13:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-27 11:13:07,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:07,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:07,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:07,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-27 11:13:07,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-04-27 11:13:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:07,391 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-27 11:13:07,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-27 11:13:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:07,392 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:07,392 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:13:07,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:13:07,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:07,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-27 11:13:07,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:07,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505044317] [2022-04-27 11:13:07,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:07,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {282#true} is VALID [2022-04-27 11:13:07,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2022-04-27 11:13:07,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #83#return; {282#true} is VALID [2022-04-27 11:13:07,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:07,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {282#true} is VALID [2022-04-27 11:13:07,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#true} assume true; {282#true} is VALID [2022-04-27 11:13:07,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#true} {282#true} #83#return; {282#true} is VALID [2022-04-27 11:13:07,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#true} call #t~ret15 := main(); {282#true} is VALID [2022-04-27 11:13:07,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {282#true} is VALID [2022-04-27 11:13:07,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {282#true} assume !(~x~0 % 4294967296 > 0); {282#true} is VALID [2022-04-27 11:13:07,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#true} ~z~0 := ~y~0; {282#true} is VALID [2022-04-27 11:13:07,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#true} assume !(~z~0 % 4294967296 > 0); {287#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:13:07,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {287#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:13:07,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {287#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {287#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-27 11:13:07,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {287#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {283#false} is VALID [2022-04-27 11:13:07,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {283#false} assume !(~z~0 % 4294967296 > 0); {283#false} is VALID [2022-04-27 11:13:07,496 INFO L272 TraceCheckUtils]: 13: Hoare triple {283#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {283#false} is VALID [2022-04-27 11:13:07,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#false} ~cond := #in~cond; {283#false} is VALID [2022-04-27 11:13:07,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {283#false} assume 0 == ~cond; {283#false} is VALID [2022-04-27 11:13:07,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {283#false} assume !false; {283#false} is VALID [2022-04-27 11:13:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:07,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505044317] [2022-04-27 11:13:07,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505044317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:07,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:07,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:13:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901625990] [2022-04-27 11:13:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:07,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:07,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:07,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:13:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:13:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:13:07,513 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,584 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-27 11:13:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:13:07,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 11:13:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-27 11:13:07,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-27 11:13:07,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:07,626 INFO L225 Difference]: With dead ends: 35 [2022-04-27 11:13:07,626 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 11:13:07,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:07,632 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:07,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 11:13:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 11:13:07,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:07,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states 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:13:07,642 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states 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:13:07,642 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states 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:13:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,650 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 11:13:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 11:13:07,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:07,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:07,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 11:13:07,652 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-27 11:13:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,654 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 11:13:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 11:13:07,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:07,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:07,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:07,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states 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:13:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-27 11:13:07,657 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2022-04-27 11:13:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:07,658 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-27 11:13:07,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 11:13:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:07,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:07,660 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:13:07,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:13:07,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-27 11:13:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:07,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465269962] [2022-04-27 11:13:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:07,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:07,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 11:13:07,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 11:13:07,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #83#return; {434#true} is VALID [2022-04-27 11:13:07,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:07,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {434#true} is VALID [2022-04-27 11:13:07,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#true} assume true; {434#true} is VALID [2022-04-27 11:13:07,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {434#true} {434#true} #83#return; {434#true} is VALID [2022-04-27 11:13:07,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#true} call #t~ret15 := main(); {434#true} is VALID [2022-04-27 11:13:07,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {434#true} is VALID [2022-04-27 11:13:07,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {434#true} assume !(~x~0 % 4294967296 > 0); {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:07,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:07,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:07,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:13:07,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {435#false} is VALID [2022-04-27 11:13:07,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#false} assume !(~x~0 % 4294967296 > 0); {435#false} is VALID [2022-04-27 11:13:07,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#false} assume !(~z~0 % 4294967296 > 0); {435#false} is VALID [2022-04-27 11:13:07,749 INFO L272 TraceCheckUtils]: 13: Hoare triple {435#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {435#false} is VALID [2022-04-27 11:13:07,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {435#false} ~cond := #in~cond; {435#false} is VALID [2022-04-27 11:13:07,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {435#false} assume 0 == ~cond; {435#false} is VALID [2022-04-27 11:13:07,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-04-27 11:13:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:07,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:07,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465269962] [2022-04-27 11:13:07,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465269962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:07,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:07,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:13:07,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605399507] [2022-04-27 11:13:07,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:07,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:07,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:07,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:07,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:13:07,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:07,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:13:07,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:13:07,769 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,859 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-27 11:13:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:13:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 11:13:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 11:13:07,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 11:13:07,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:07,904 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:13:07,904 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:13:07,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:07,913 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:07,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:13:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 11:13:07,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:07,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:13:07,931 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:13:07,931 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:13:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,932 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-27 11:13:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-27 11:13:07,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:07,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:07,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:13:07,933 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:13:07,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:07,935 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-27 11:13:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-27 11:13:07,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:07,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:07,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:07,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states 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:13:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-27 11:13:07,937 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 17 [2022-04-27 11:13:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:07,937 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-04-27 11:13:07,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-04-27 11:13:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:07,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:07,938 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:13:07,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:13:07,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-04-27 11:13:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:07,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629762870] [2022-04-27 11:13:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:07,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {614#true} is VALID [2022-04-27 11:13:08,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 11:13:08,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {614#true} {614#true} #83#return; {614#true} is VALID [2022-04-27 11:13:08,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {614#true} call ULTIMATE.init(); {621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:08,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {614#true} is VALID [2022-04-27 11:13:08,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {614#true} assume true; {614#true} is VALID [2022-04-27 11:13:08,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {614#true} {614#true} #83#return; {614#true} is VALID [2022-04-27 11:13:08,006 INFO L272 TraceCheckUtils]: 4: Hoare triple {614#true} call #t~ret15 := main(); {614#true} is VALID [2022-04-27 11:13:08,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {619#(= main_~y~0 0)} is VALID [2022-04-27 11:13:08,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {619#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {619#(= main_~y~0 0)} is VALID [2022-04-27 11:13:08,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(= main_~y~0 0)} ~z~0 := ~y~0; {620#(= main_~z~0 0)} is VALID [2022-04-27 11:13:08,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {615#false} is VALID [2022-04-27 11:13:08,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {615#false} assume !(~z~0 % 4294967296 > 0); {615#false} is VALID [2022-04-27 11:13:08,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {615#false} assume !(~y~0 % 4294967296 > 0); {615#false} is VALID [2022-04-27 11:13:08,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {615#false} assume !(~x~0 % 4294967296 > 0); {615#false} is VALID [2022-04-27 11:13:08,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {615#false} assume !(~z~0 % 4294967296 > 0); {615#false} is VALID [2022-04-27 11:13:08,012 INFO L272 TraceCheckUtils]: 13: Hoare triple {615#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {615#false} is VALID [2022-04-27 11:13:08,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#false} ~cond := #in~cond; {615#false} is VALID [2022-04-27 11:13:08,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#false} assume 0 == ~cond; {615#false} is VALID [2022-04-27 11:13:08,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {615#false} assume !false; {615#false} is VALID [2022-04-27 11:13:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629762870] [2022-04-27 11:13:08,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629762870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:13:08,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:13:08,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:13:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076096592] [2022-04-27 11:13:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:13:08,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:08,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:08,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:08,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:13:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:13:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:13:08,027 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:08,135 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-04-27 11:13:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:13:08,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 11:13:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-27 11:13:08,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-27 11:13:08,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:08,177 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:13:08,177 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 11:13:08,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:13:08,179 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:08,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:13:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 11:13:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 11:13:08,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:08,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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:13:08,190 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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:13:08,190 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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:13:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:08,192 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-27 11:13:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-27 11:13:08,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:08,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:08,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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 26 states. [2022-04-27 11:13:08,193 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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 26 states. [2022-04-27 11:13:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:08,195 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-27 11:13:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-27 11:13:08,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:08,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:08,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:08,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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:13:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-04-27 11:13:08,197 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 17 [2022-04-27 11:13:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:08,198 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-04-27 11:13:08,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-27 11:13:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:13:08,202 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:08,202 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:13:08,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 11:13:08,202 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-04-27 11:13:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:08,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359135227] [2022-04-27 11:13:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-27 11:13:08,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 11:13:08,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-27 11:13:08,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:08,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-27 11:13:08,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 11:13:08,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-27 11:13:08,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-27 11:13:08,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {779#(= main_~y~0 0)} is VALID [2022-04-27 11:13:08,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:08,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:08,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {781#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:08,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#false} assume !(~y~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#false} assume !(~x~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {775#false} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,284 INFO L272 TraceCheckUtils]: 13: Hoare triple {775#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {775#false} is VALID [2022-04-27 11:13:08,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-27 11:13:08,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-27 11:13:08,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-27 11:13:08,285 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:13:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:08,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359135227] [2022-04-27 11:13:08,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359135227] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:08,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238988458] [2022-04-27 11:13:08,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:08,287 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:13:08,297 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:13:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:13:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:08,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:08,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-27 11:13:08,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-27 11:13:08,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 11:13:08,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-27 11:13:08,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-27 11:13:08,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {779#(= main_~y~0 0)} is VALID [2022-04-27 11:13:08,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:08,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:08,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {810#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:08,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {810#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#false} assume !(~y~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#false} assume !(~x~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {775#false} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,657 INFO L272 TraceCheckUtils]: 13: Hoare triple {775#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {775#false} is VALID [2022-04-27 11:13:08,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-27 11:13:08,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-27 11:13:08,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-27 11:13:08,658 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:13:08,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:08,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-27 11:13:08,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2022-04-27 11:13:08,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2022-04-27 11:13:08,759 INFO L272 TraceCheckUtils]: 13: Hoare triple {775#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {775#false} is VALID [2022-04-27 11:13:08,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {775#false} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#false} assume !(~x~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#false} assume !(~y~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {856#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {775#false} is VALID [2022-04-27 11:13:08,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {856#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:08,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {860#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {860#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:08,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {867#(< 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; {860#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:08,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {867#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:08,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-27 11:13:08,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-27 11:13:08,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-27 11:13:08,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-27 11:13:08,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2022-04-27 11:13:08,762 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:13:08,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238988458] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:08,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:08,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 11:13:08,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720886530] [2022-04-27 11:13:08,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:08,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:08,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (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:08,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:08,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:13:08,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:08,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:13:08,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:13:08,786 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (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:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:09,333 INFO L93 Difference]: Finished difference Result 75 states and 114 transitions. [2022-04-27 11:13:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:13:09,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:13:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (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:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-04-27 11:13:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (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:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2022-04-27 11:13:09,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2022-04-27 11:13:09,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:09,430 INFO L225 Difference]: With dead ends: 75 [2022-04-27 11:13:09,430 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 11:13:09,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:13:09,433 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:09,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 41 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:13:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 11:13:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2022-04-27 11:13:09,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:09,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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:13:09,460 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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:13:09,460 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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:13:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:09,463 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-27 11:13:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2022-04-27 11:13:09,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:09,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:09,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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:13:09,465 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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:13:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:09,467 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-27 11:13:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2022-04-27 11:13:09,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:09,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:09,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:09,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 3 states 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:13:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-27 11:13:09,470 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 17 [2022-04-27 11:13:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:09,471 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2022-04-27 11:13:09,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (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:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2022-04-27 11:13:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:13:09,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:09,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:09,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:13:09,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 11:13:09,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:09,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 1 times [2022-04-27 11:13:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:09,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294368000] [2022-04-27 11:13:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:09,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:09,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {1192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1182#true} is VALID [2022-04-27 11:13:09,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {1182#true} assume true; {1182#true} is VALID [2022-04-27 11:13:09,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1182#true} {1182#true} #83#return; {1182#true} is VALID [2022-04-27 11:13:09,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {1182#true} call ULTIMATE.init(); {1192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:09,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {1192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1182#true} is VALID [2022-04-27 11:13:09,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {1182#true} assume true; {1182#true} is VALID [2022-04-27 11:13:09,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1182#true} {1182#true} #83#return; {1182#true} is VALID [2022-04-27 11:13:09,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {1182#true} call #t~ret15 := main(); {1182#true} is VALID [2022-04-27 11:13:09,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {1182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1187#(= main_~y~0 0)} is VALID [2022-04-27 11:13:09,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1188#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:09,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1188#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:09,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:09,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {1189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:09,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {1190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:09,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1191#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:09,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {1191#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:09,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {1191#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:09,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1183#false} is VALID [2022-04-27 11:13:09,808 INFO L272 TraceCheckUtils]: 15: Hoare triple {1183#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1183#false} is VALID [2022-04-27 11:13:09,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#false} ~cond := #in~cond; {1183#false} is VALID [2022-04-27 11:13:09,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#false} assume 0 == ~cond; {1183#false} is VALID [2022-04-27 11:13:09,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#false} assume !false; {1183#false} is VALID [2022-04-27 11:13:09,809 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:13:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:09,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294368000] [2022-04-27 11:13:09,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294368000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:09,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70821011] [2022-04-27 11:13:09,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:09,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:09,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:09,812 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:13:09,840 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:13:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:09,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:13:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:09,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:09,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1182#true} call ULTIMATE.init(); {1182#true} is VALID [2022-04-27 11:13:09,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1182#true} is VALID [2022-04-27 11:13:09,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1182#true} assume true; {1182#true} is VALID [2022-04-27 11:13:09,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1182#true} {1182#true} #83#return; {1182#true} is VALID [2022-04-27 11:13:09,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {1182#true} call #t~ret15 := main(); {1182#true} is VALID [2022-04-27 11:13:09,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {1182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1182#true} is VALID [2022-04-27 11:13:09,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:09,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:09,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:09,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:09,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:09,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:09,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:09,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1183#false} is VALID [2022-04-27 11:13:09,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#false} assume !(~z~0 % 4294967296 > 0); {1183#false} is VALID [2022-04-27 11:13:09,957 INFO L272 TraceCheckUtils]: 15: Hoare triple {1183#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1183#false} is VALID [2022-04-27 11:13:09,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#false} ~cond := #in~cond; {1183#false} is VALID [2022-04-27 11:13:09,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#false} assume 0 == ~cond; {1183#false} is VALID [2022-04-27 11:13:09,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#false} assume !false; {1183#false} is VALID [2022-04-27 11:13:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:09,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:10,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#false} assume !false; {1183#false} is VALID [2022-04-27 11:13:10,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#false} assume 0 == ~cond; {1183#false} is VALID [2022-04-27 11:13:10,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#false} ~cond := #in~cond; {1183#false} is VALID [2022-04-27 11:13:10,036 INFO L272 TraceCheckUtils]: 15: Hoare triple {1183#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1183#false} is VALID [2022-04-27 11:13:10,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#false} assume !(~z~0 % 4294967296 > 0); {1183#false} is VALID [2022-04-27 11:13:10,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1183#false} is VALID [2022-04-27 11:13:10,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:10,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:10,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {1224#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:10,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1224#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:10,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:10,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:10,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:10,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {1182#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1182#true} is VALID [2022-04-27 11:13:10,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {1182#true} call #t~ret15 := main(); {1182#true} is VALID [2022-04-27 11:13:10,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1182#true} {1182#true} #83#return; {1182#true} is VALID [2022-04-27 11:13:10,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1182#true} assume true; {1182#true} is VALID [2022-04-27 11:13:10,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1182#true} is VALID [2022-04-27 11:13:10,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {1182#true} call ULTIMATE.init(); {1182#true} is VALID [2022-04-27 11:13:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:10,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70821011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:10,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:10,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-27 11:13:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536137210] [2022-04-27 11:13:10,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:10,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (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:13:10,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:10,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (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:10,070 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:13:10,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:13:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:13:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:13:10,072 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (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:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:10,693 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2022-04-27 11:13:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:13:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (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:13:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (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:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2022-04-27 11:13:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (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:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2022-04-27 11:13:10,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2022-04-27 11:13:10,774 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:13:10,775 INFO L225 Difference]: With dead ends: 71 [2022-04-27 11:13:10,775 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 11:13:10,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:13:10,776 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:10,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 52 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:13:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 11:13:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-04-27 11:13:10,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:10,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 48 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:10,807 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 48 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:10,807 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 48 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:10,810 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2022-04-27 11:13:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2022-04-27 11:13:10,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:10,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:10,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-27 11:13:10,811 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-27 11:13:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:10,815 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2022-04-27 11:13:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2022-04-27 11:13:10,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:10,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:10,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:10,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2022-04-27 11:13:10,817 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 19 [2022-04-27 11:13:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:10,817 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2022-04-27 11:13:10,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (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:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2022-04-27 11:13:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:13:10,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:10,818 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:10,847 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:13:11,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-27 11:13:11,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1933081666, now seen corresponding path program 2 times [2022-04-27 11:13:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:11,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556679159] [2022-04-27 11:13:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:11,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:11,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {1621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1610#true} is VALID [2022-04-27 11:13:11,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1610#true} assume true; {1610#true} is VALID [2022-04-27 11:13:11,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1610#true} {1610#true} #83#return; {1610#true} is VALID [2022-04-27 11:13:11,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {1610#true} call ULTIMATE.init(); {1621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:11,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {1621#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1610#true} is VALID [2022-04-27 11:13:11,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {1610#true} assume true; {1610#true} is VALID [2022-04-27 11:13:11,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1610#true} {1610#true} #83#return; {1610#true} is VALID [2022-04-27 11:13:11,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {1610#true} call #t~ret15 := main(); {1610#true} is VALID [2022-04-27 11:13:11,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {1610#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1615#(= main_~y~0 0)} is VALID [2022-04-27 11:13:11,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {1615#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:11,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {1616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:11,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {1617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1618#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:11,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {1618#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:11,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:11,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1620#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:11,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {1620#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#false} assume !(~y~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {1611#false} assume !(~x~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {1611#false} assume !(~z~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,184 INFO L272 TraceCheckUtils]: 16: Hoare triple {1611#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1611#false} is VALID [2022-04-27 11:13:11,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {1611#false} ~cond := #in~cond; {1611#false} is VALID [2022-04-27 11:13:11,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {1611#false} assume 0 == ~cond; {1611#false} is VALID [2022-04-27 11:13:11,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {1611#false} assume !false; {1611#false} is VALID [2022-04-27 11:13:11,184 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:13:11,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:11,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556679159] [2022-04-27 11:13:11,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556679159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:11,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078194073] [2022-04-27 11:13:11,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:11,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:11,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:11,186 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:13:11,212 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:13:11,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:11,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:11,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:13:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:11,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:11,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {1610#true} call ULTIMATE.init(); {1610#true} is VALID [2022-04-27 11:13:11,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1610#true} is VALID [2022-04-27 11:13:11,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1610#true} assume true; {1610#true} is VALID [2022-04-27 11:13:11,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1610#true} {1610#true} #83#return; {1610#true} is VALID [2022-04-27 11:13:11,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {1610#true} call #t~ret15 := main(); {1610#true} is VALID [2022-04-27 11:13:11,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {1610#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1615#(= main_~y~0 0)} is VALID [2022-04-27 11:13:11,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {1615#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:11,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1616#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:11,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1617#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1618#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:11,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {1618#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:11,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:11,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1658#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:11,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {1658#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#false} assume !(~y~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {1611#false} assume !(~x~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {1611#false} assume !(~z~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,477 INFO L272 TraceCheckUtils]: 16: Hoare triple {1611#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1611#false} is VALID [2022-04-27 11:13:11,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {1611#false} ~cond := #in~cond; {1611#false} is VALID [2022-04-27 11:13:11,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {1611#false} assume 0 == ~cond; {1611#false} is VALID [2022-04-27 11:13:11,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {1611#false} assume !false; {1611#false} is VALID [2022-04-27 11:13:11,478 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:13:11,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:11,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {1611#false} assume !false; {1611#false} is VALID [2022-04-27 11:13:11,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {1611#false} assume 0 == ~cond; {1611#false} is VALID [2022-04-27 11:13:11,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {1611#false} ~cond := #in~cond; {1611#false} is VALID [2022-04-27 11:13:11,619 INFO L272 TraceCheckUtils]: 16: Hoare triple {1611#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1611#false} is VALID [2022-04-27 11:13:11,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {1611#false} assume !(~z~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {1611#false} assume !(~x~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#false} assume !(~y~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {1704#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1611#false} is VALID [2022-04-27 11:13:11,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {1708#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1704#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:11,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {1708#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1708#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:11,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {1715#(< 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; {1708#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:11,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {1719#(< 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; {1715#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:11,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#(< 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; {1719#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:11,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {1727#(< 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; {1723#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:11,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {1610#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1727#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:11,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {1610#true} call #t~ret15 := main(); {1610#true} is VALID [2022-04-27 11:13:11,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1610#true} {1610#true} #83#return; {1610#true} is VALID [2022-04-27 11:13:11,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {1610#true} assume true; {1610#true} is VALID [2022-04-27 11:13:11,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1610#true} is VALID [2022-04-27 11:13:11,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {1610#true} call ULTIMATE.init(); {1610#true} is VALID [2022-04-27 11:13:11,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:13:11,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078194073] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:11,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:11,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-27 11:13:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069806578] [2022-04-27 11:13:11,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (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 20 [2022-04-27 11:13:11,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:11,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (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:11,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:11,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:13:11,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:13:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:13:11,655 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (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:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:13,652 INFO L93 Difference]: Finished difference Result 196 states and 310 transitions. [2022-04-27 11:13:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:13:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (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 20 [2022-04-27 11:13:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (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:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 176 transitions. [2022-04-27 11:13:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (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:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 176 transitions. [2022-04-27 11:13:13,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 176 transitions. [2022-04-27 11:13:13,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:13,855 INFO L225 Difference]: With dead ends: 196 [2022-04-27 11:13:13,855 INFO L226 Difference]: Without dead ends: 178 [2022-04-27 11:13:13,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 11:13:13,857 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 306 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:13,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 84 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 11:13:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-27 11:13:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 75. [2022-04-27 11:13:13,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:13,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 75 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:13,932 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 75 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:13,932 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 75 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:13,938 INFO L93 Difference]: Finished difference Result 178 states and 260 transitions. [2022-04-27 11:13:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 260 transitions. [2022-04-27 11:13:13,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:13,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:13,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-27 11:13:13,940 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-27 11:13:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:13,945 INFO L93 Difference]: Finished difference Result 178 states and 260 transitions. [2022-04-27 11:13:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 260 transitions. [2022-04-27 11:13:13,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:13,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:13,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:13,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2022-04-27 11:13:13,949 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 20 [2022-04-27 11:13:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:13,949 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2022-04-27 11:13:13,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (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:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2022-04-27 11:13:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:13:13,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:13,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:13,974 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:13:14,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:14,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-27 11:13:14,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:14,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630272182] [2022-04-27 11:13:14,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:14,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:14,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {2528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2516#true} is VALID [2022-04-27 11:13:14,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 11:13:14,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2516#true} {2516#true} #83#return; {2516#true} is VALID [2022-04-27 11:13:14,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:14,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {2528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2516#true} is VALID [2022-04-27 11:13:14,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 11:13:14,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} #83#return; {2516#true} is VALID [2022-04-27 11:13:14,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} call #t~ret15 := main(); {2516#true} is VALID [2022-04-27 11:13:14,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2516#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:14,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-27 11:13:14,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} ~z~0 := ~y~0; {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-27 11:13:14,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:13:14,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:13:14,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:13:14,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:13:14,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {2524#(and (<= main_~x~0 main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-27 11:13:14,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-27 11:13:14,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {2523#(and (<= (* (div (+ main_~n~0 4294967294) 4294967296) 4294967296) main_~x~0) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,453 INFO L272 TraceCheckUtils]: 17: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:14,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {2526#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2527#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:14,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {2527#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2517#false} is VALID [2022-04-27 11:13:14,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2022-04-27 11:13:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630272182] [2022-04-27 11:13:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630272182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829729256] [2022-04-27 11:13:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:14,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:14,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:14,456 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:13:14,457 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:13:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:14,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:13:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:14,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:14,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2516#true} is VALID [2022-04-27 11:13:14,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2516#true} is VALID [2022-04-27 11:13:14,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 11:13:14,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} #83#return; {2516#true} is VALID [2022-04-27 11:13:14,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} call #t~ret15 := main(); {2516#true} is VALID [2022-04-27 11:13:14,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {2516#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:14,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:14,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:14,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) 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; {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:14,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:13:14,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {2522#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:14,670 INFO L272 TraceCheckUtils]: 17: Hoare triple {2521#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:14,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {2583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:14,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {2587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2517#false} is VALID [2022-04-27 11:13:14,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2022-04-27 11:13:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:14,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:14,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {2517#false} assume !false; {2517#false} is VALID [2022-04-27 11:13:14,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {2587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2517#false} is VALID [2022-04-27 11:13:14,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {2583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:14,904 INFO L272 TraceCheckUtils]: 17: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:14,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:14,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:14,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} ~z~0 := ~y~0; {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:14,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:14,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2609#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:14,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {2516#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2525#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:14,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {2516#true} call #t~ret15 := main(); {2516#true} is VALID [2022-04-27 11:13:14,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2516#true} {2516#true} #83#return; {2516#true} is VALID [2022-04-27 11:13:14,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {2516#true} assume true; {2516#true} is VALID [2022-04-27 11:13:14,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {2516#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2516#true} is VALID [2022-04-27 11:13:14,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {2516#true} call ULTIMATE.init(); {2516#true} is VALID [2022-04-27 11:13:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:13:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829729256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:14,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:14,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 13 [2022-04-27 11:13:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454472184] [2022-04-27 11:13:14,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:14,913 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 10 states have internal predecessors, (41), 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 21 [2022-04-27 11:13:14,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:14,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 10 states have internal predecessors, (41), 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:13:14,950 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:13:14,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:13:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:13:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:13:14,951 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 10 states have internal predecessors, (41), 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:13:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:15,433 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2022-04-27 11:13:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:13:15,433 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 10 states have internal predecessors, (41), 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 21 [2022-04-27 11:13:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 10 states have internal predecessors, (41), 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:13:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-27 11:13:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 10 states have internal predecessors, (41), 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:13:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-27 11:13:15,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2022-04-27 11:13:15,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:15,490 INFO L225 Difference]: With dead ends: 87 [2022-04-27 11:13:15,490 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 11:13:15,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:13:15,491 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:15,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 51 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 11:13:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 11:13:15,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:15,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:15,564 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:15,564 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:15,565 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2022-04-27 11:13:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2022-04-27 11:13:15,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:15,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:15,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 11:13:15,566 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 11:13:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:15,568 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2022-04-27 11:13:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2022-04-27 11:13:15,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:15,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:15,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:15,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2022-04-27 11:13:15,570 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 21 [2022-04-27 11:13:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:15,571 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2022-04-27 11:13:15,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 10 states have internal predecessors, (41), 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:13:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2022-04-27 11:13:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:13:15,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:15,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:15,594 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:13:15,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:15,794 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:15,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash 38994402, now seen corresponding path program 1 times [2022-04-27 11:13:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:15,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437901514] [2022-04-27 11:13:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:15,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:15,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {3037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3027#true} is VALID [2022-04-27 11:13:15,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {3027#true} assume true; {3027#true} is VALID [2022-04-27 11:13:15,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3027#true} {3027#true} #83#return; {3027#true} is VALID [2022-04-27 11:13:15,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {3027#true} call ULTIMATE.init(); {3037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:15,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {3037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3027#true} is VALID [2022-04-27 11:13:15,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2022-04-27 11:13:15,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3027#true} #83#return; {3027#true} is VALID [2022-04-27 11:13:15,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {3027#true} call #t~ret15 := main(); {3027#true} is VALID [2022-04-27 11:13:15,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {3027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3032#(= main_~y~0 0)} is VALID [2022-04-27 11:13:15,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {3032#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3033#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:15,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3033#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:15,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:15,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3035#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:15,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {3035#(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; {3036#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:15,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {3036#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:15,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {3028#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3028#false} is VALID [2022-04-27 11:13:15,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {3028#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3028#false} is VALID [2022-04-27 11:13:15,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {3028#false} assume !(~y~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {3028#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {3028#false} assume !(~x~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {3028#false} assume !(~z~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L272 TraceCheckUtils]: 18: Hoare triple {3028#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {3028#false} ~cond := #in~cond; {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {3028#false} assume 0 == ~cond; {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {3028#false} assume !false; {3028#false} is VALID [2022-04-27 11:13:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:15,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437901514] [2022-04-27 11:13:15,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437901514] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:15,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224011384] [2022-04-27 11:13:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:15,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:15,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:15,883 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:13:15,891 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:13:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:15,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:13:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:15,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:16,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {3027#true} call ULTIMATE.init(); {3027#true} is VALID [2022-04-27 11:13:16,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {3027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3027#true} is VALID [2022-04-27 11:13:16,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2022-04-27 11:13:16,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3027#true} #83#return; {3027#true} is VALID [2022-04-27 11:13:16,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {3027#true} call #t~ret15 := main(); {3027#true} is VALID [2022-04-27 11:13:16,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {3027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3032#(= main_~y~0 0)} is VALID [2022-04-27 11:13:16,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {3032#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3033#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:16,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {3033#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:16,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:16,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {3034#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3068#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:16,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {3068#(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; {3072#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {3072#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {3028#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {3028#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {3028#false} assume !(~y~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {3028#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {3028#false} assume !(~x~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {3028#false} assume !(~z~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L272 TraceCheckUtils]: 18: Hoare triple {3028#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {3028#false} ~cond := #in~cond; {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {3028#false} assume 0 == ~cond; {3028#false} is VALID [2022-04-27 11:13:16,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {3028#false} assume !false; {3028#false} is VALID [2022-04-27 11:13:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:16,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:16,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {3028#false} assume !false; {3028#false} is VALID [2022-04-27 11:13:16,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {3028#false} assume 0 == ~cond; {3028#false} is VALID [2022-04-27 11:13:16,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {3028#false} ~cond := #in~cond; {3028#false} is VALID [2022-04-27 11:13:16,215 INFO L272 TraceCheckUtils]: 18: Hoare triple {3028#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3028#false} is VALID [2022-04-27 11:13:16,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {3028#false} assume !(~z~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:16,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {3028#false} assume !(~x~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:16,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {3028#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3028#false} is VALID [2022-04-27 11:13:16,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {3028#false} assume !(~y~0 % 4294967296 > 0); {3028#false} is VALID [2022-04-27 11:13:16,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {3130#(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; {3028#false} is VALID [2022-04-27 11:13:16,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {3134#(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; {3130#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:13:16,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {3138#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3134#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:13:16,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {3142#(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; {3138#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:16,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {3027#true} ~z~0 := ~y~0; {3142#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:13:16,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {3027#true} assume !(~x~0 % 4294967296 > 0); {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {3027#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {3027#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {3027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {3027#true} call #t~ret15 := main(); {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3027#true} {3027#true} #83#return; {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {3027#true} assume true; {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {3027#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {3027#true} call ULTIMATE.init(); {3027#true} is VALID [2022-04-27 11:13:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:13:16,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224011384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:16,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:16,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-27 11:13:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006890280] [2022-04-27 11:13:16,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:13:16,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:16,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:16,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:16,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:13:16,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:13:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:13:16,248 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,049 INFO L93 Difference]: Finished difference Result 107 states and 151 transitions. [2022-04-27 11:13:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 11:13:17,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:13:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-27 11:13:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 86 transitions. [2022-04-27 11:13:17,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 86 transitions. [2022-04-27 11:13:17,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:17,127 INFO L225 Difference]: With dead ends: 107 [2022-04-27 11:13:17,128 INFO L226 Difference]: Without dead ends: 87 [2022-04-27 11:13:17,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:13:17,129 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:17,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 50 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:13:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-27 11:13:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2022-04-27 11:13:17,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:17,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states 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:13:17,210 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states 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:13:17,210 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states 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:13:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,212 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-27 11:13:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2022-04-27 11:13:17,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-27 11:13:17,213 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-27 11:13:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:17,214 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-27 11:13:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2022-04-27 11:13:17,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:17,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:17,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:17,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 3 states have call successors, (3), 3 states 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:13:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-04-27 11:13:17,216 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 22 [2022-04-27 11:13:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:17,217 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-04-27 11:13:17,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 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:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-27 11:13:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:13:17,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:17,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:17,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 11:13:17,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 11:13:17,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash -462225342, now seen corresponding path program 2 times [2022-04-27 11:13:17,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:17,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801470453] [2022-04-27 11:13:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {3635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3623#true} is VALID [2022-04-27 11:13:17,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-27 11:13:17,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3623#true} {3623#true} #83#return; {3623#true} is VALID [2022-04-27 11:13:17,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:17,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {3635#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3623#true} is VALID [2022-04-27 11:13:17,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-27 11:13:17,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #83#return; {3623#true} is VALID [2022-04-27 11:13:17,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {3623#true} call #t~ret15 := main(); {3623#true} is VALID [2022-04-27 11:13:17,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {3623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3628#(= main_~y~0 0)} is VALID [2022-04-27 11:13:17,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {3628#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:17,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {3629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:17,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {3630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {3630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:17,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {3630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {3631#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:17,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {3631#(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; {3632#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:17,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {3632#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3633#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:17,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {3633#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3633#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:17,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {3633#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3632#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:17,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {3632#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3634#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:17,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {3634#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {3634#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:17,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {3634#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {3634#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:17,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {3634#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3624#false} is VALID [2022-04-27 11:13:17,628 INFO L272 TraceCheckUtils]: 18: Hoare triple {3624#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3624#false} is VALID [2022-04-27 11:13:17,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#false} ~cond := #in~cond; {3624#false} is VALID [2022-04-27 11:13:17,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {3624#false} assume 0 == ~cond; {3624#false} is VALID [2022-04-27 11:13:17,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2022-04-27 11:13:17,628 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:13:17,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:17,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801470453] [2022-04-27 11:13:17,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801470453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:17,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457577805] [2022-04-27 11:13:17,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:17,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:17,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:17,629 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:13:17,630 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:13:17,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:17,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:17,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:13:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:17,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:17,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3623#true} is VALID [2022-04-27 11:13:17,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {3623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3623#true} is VALID [2022-04-27 11:13:17,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-27 11:13:17,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #83#return; {3623#true} is VALID [2022-04-27 11:13:17,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {3623#true} call #t~ret15 := main(); {3623#true} is VALID [2022-04-27 11:13:17,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {3623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3623#true} is VALID [2022-04-27 11:13:17,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {3623#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:17,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:17,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:17,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:17,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:17,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3624#false} is VALID [2022-04-27 11:13:17,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {3624#false} assume !(~z~0 % 4294967296 > 0); {3624#false} is VALID [2022-04-27 11:13:17,786 INFO L272 TraceCheckUtils]: 18: Hoare triple {3624#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3624#false} is VALID [2022-04-27 11:13:17,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#false} ~cond := #in~cond; {3624#false} is VALID [2022-04-27 11:13:17,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {3624#false} assume 0 == ~cond; {3624#false} is VALID [2022-04-27 11:13:17,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2022-04-27 11:13:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:17,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:17,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2022-04-27 11:13:17,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {3624#false} assume 0 == ~cond; {3624#false} is VALID [2022-04-27 11:13:17,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {3624#false} ~cond := #in~cond; {3624#false} is VALID [2022-04-27 11:13:17,883 INFO L272 TraceCheckUtils]: 18: Hoare triple {3624#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3624#false} is VALID [2022-04-27 11:13:17,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {3624#false} assume !(~z~0 % 4294967296 > 0); {3624#false} is VALID [2022-04-27 11:13:17,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3624#false} is VALID [2022-04-27 11:13:17,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {3674#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3674#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:17,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:17,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:17,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:17,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3661#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:17,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {3623#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3657#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:17,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {3623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3623#true} is VALID [2022-04-27 11:13:17,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {3623#true} call #t~ret15 := main(); {3623#true} is VALID [2022-04-27 11:13:17,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #83#return; {3623#true} is VALID [2022-04-27 11:13:17,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-27 11:13:17,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {3623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3623#true} is VALID [2022-04-27 11:13:17,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3623#true} is VALID [2022-04-27 11:13:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:17,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457577805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:17,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:17,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-27 11:13:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654699124] [2022-04-27 11:13:17,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:17,890 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:13:17,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:17,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:13:17,920 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:13:17,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:13:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:13:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:13:17,921 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:13:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:19,242 INFO L93 Difference]: Finished difference Result 117 states and 170 transitions. [2022-04-27 11:13:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 11:13:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:13:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:13:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 102 transitions. [2022-04-27 11:13:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:13:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 102 transitions. [2022-04-27 11:13:19,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 102 transitions. [2022-04-27 11:13:19,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:19,348 INFO L225 Difference]: With dead ends: 117 [2022-04-27 11:13:19,349 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 11:13:19,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2022-04-27 11:13:19,350 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 71 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:19,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 73 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:13:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 11:13:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-04-27 11:13:19,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:19,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 79 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 3 states have call successors, (3), 3 states 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:13:19,449 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 79 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 3 states have call successors, (3), 3 states 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:13:19,450 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 79 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 3 states have call successors, (3), 3 states 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:13:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:19,452 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2022-04-27 11:13:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2022-04-27 11:13:19,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:19,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:19,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-27 11:13:19,453 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 104 states. [2022-04-27 11:13:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:19,455 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2022-04-27 11:13:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 142 transitions. [2022-04-27 11:13:19,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:19,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:19,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:19,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 3 states have call successors, (3), 3 states 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:13:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2022-04-27 11:13:19,457 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 22 [2022-04-27 11:13:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:19,457 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2022-04-27 11:13:19,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:13:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2022-04-27 11:13:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 11:13:19,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:19,458 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:19,486 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:13:19,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:19,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash 295906898, now seen corresponding path program 2 times [2022-04-27 11:13:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:19,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493446351] [2022-04-27 11:13:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:19,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {4307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4294#true} is VALID [2022-04-27 11:13:19,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-04-27 11:13:19,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4294#true} {4294#true} #83#return; {4294#true} is VALID [2022-04-27 11:13:19,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {4294#true} call ULTIMATE.init(); {4307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:19,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {4307#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4294#true} is VALID [2022-04-27 11:13:19,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-04-27 11:13:19,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4294#true} {4294#true} #83#return; {4294#true} is VALID [2022-04-27 11:13:19,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {4294#true} call #t~ret15 := main(); {4294#true} is VALID [2022-04-27 11:13:19,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {4294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4299#(= main_~y~0 0)} is VALID [2022-04-27 11:13:19,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {4299#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:19,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {4300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:19,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {4301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:19,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {4302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:19,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {4303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:19,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:19,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4305#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:19,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#(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; {4306#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:19,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {4306#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:19,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {4295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4295#false} is VALID [2022-04-27 11:13:19,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {4295#false} assume !(~y~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:19,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4295#false} is VALID [2022-04-27 11:13:19,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {4295#false} assume !(~x~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:19,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {4295#false} assume !(~z~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:19,826 INFO L272 TraceCheckUtils]: 20: Hoare triple {4295#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4295#false} is VALID [2022-04-27 11:13:19,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-04-27 11:13:19,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {4295#false} assume 0 == ~cond; {4295#false} is VALID [2022-04-27 11:13:19,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-04-27 11:13:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:19,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493446351] [2022-04-27 11:13:19,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493446351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:19,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64573550] [2022-04-27 11:13:19,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:19,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:19,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:19,827 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:13:19,828 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:13:19,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:19,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:19,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:13:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:19,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:20,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {4294#true} call ULTIMATE.init(); {4294#true} is VALID [2022-04-27 11:13:20,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {4294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4294#true} is VALID [2022-04-27 11:13:20,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-04-27 11:13:20,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4294#true} {4294#true} #83#return; {4294#true} is VALID [2022-04-27 11:13:20,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {4294#true} call #t~ret15 := main(); {4294#true} is VALID [2022-04-27 11:13:20,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {4294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4299#(= main_~y~0 0)} is VALID [2022-04-27 11:13:20,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {4299#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:20,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {4300#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:20,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {4301#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:20,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {4302#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:20,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {4303#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:20,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:20,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {4304#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4305#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#(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; {4350#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {4350#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {4295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4295#false} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {4295#false} assume !(~y~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4295#false} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {4295#false} assume !(~x~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {4295#false} assume !(~z~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,089 INFO L272 TraceCheckUtils]: 20: Hoare triple {4295#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4295#false} is VALID [2022-04-27 11:13:20,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-04-27 11:13:20,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {4295#false} assume 0 == ~cond; {4295#false} is VALID [2022-04-27 11:13:20,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-04-27 11:13:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:20,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {4295#false} assume !false; {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {4295#false} assume 0 == ~cond; {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {4295#false} ~cond := #in~cond; {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L272 TraceCheckUtils]: 20: Hoare triple {4295#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {4295#false} assume !(~z~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {4295#false} assume !(~x~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {4295#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {4295#false} assume !(~y~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {4295#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4295#false} is VALID [2022-04-27 11:13:20,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {4408#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4295#false} is VALID [2022-04-27 11:13:20,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {4412#(< 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; {4408#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:20,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {4416#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {4412#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:20,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {4416#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4416#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:20,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {4423#(< 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; {4416#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:13:20,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {4427#(< 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; {4423#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:20,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {4431#(< 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; {4427#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:20,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {4435#(< 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; {4431#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:20,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(< 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; {4435#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:20,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {4294#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4439#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:20,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {4294#true} call #t~ret15 := main(); {4294#true} is VALID [2022-04-27 11:13:20,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4294#true} {4294#true} #83#return; {4294#true} is VALID [2022-04-27 11:13:20,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {4294#true} assume true; {4294#true} is VALID [2022-04-27 11:13:20,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {4294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4294#true} is VALID [2022-04-27 11:13:20,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {4294#true} call ULTIMATE.init(); {4294#true} is VALID [2022-04-27 11:13:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:13:20,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64573550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:20,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:20,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-27 11:13:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088675149] [2022-04-27 11:13:20,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 24 [2022-04-27 11:13:20,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:20,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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:20,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:20,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 11:13:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 11:13:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:13:20,304 INFO L87 Difference]: Start difference. First operand 79 states and 108 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:24,957 INFO L93 Difference]: Finished difference Result 273 states and 404 transitions. [2022-04-27 11:13:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-27 11:13:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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 24 [2022-04-27 11:13:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 246 transitions. [2022-04-27 11:13:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 246 transitions. [2022-04-27 11:13:24,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 246 transitions. [2022-04-27 11:13:25,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:25,342 INFO L225 Difference]: With dead ends: 273 [2022-04-27 11:13:25,342 INFO L226 Difference]: Without dead ends: 249 [2022-04-27 11:13:25,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1438, Invalid=4568, Unknown=0, NotChecked=0, Total=6006 [2022-04-27 11:13:25,344 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 396 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:25,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 86 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:13:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-27 11:13:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 98. [2022-04-27 11:13:25,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:25,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 98 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 3 states have call successors, (3), 3 states 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:13:25,472 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 98 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 3 states have call successors, (3), 3 states 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:13:25,473 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 98 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 3 states have call successors, (3), 3 states 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:13:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:25,478 INFO L93 Difference]: Finished difference Result 249 states and 347 transitions. [2022-04-27 11:13:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2022-04-27 11:13:25,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:25,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:25,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-27 11:13:25,479 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 249 states. [2022-04-27 11:13:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:25,484 INFO L93 Difference]: Finished difference Result 249 states and 347 transitions. [2022-04-27 11:13:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2022-04-27 11:13:25,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:25,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:25,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:25,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 3 states have call successors, (3), 3 states 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:13:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2022-04-27 11:13:25,487 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 24 [2022-04-27 11:13:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:25,487 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2022-04-27 11:13:25,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 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:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2022-04-27 11:13:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:13:25,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:25,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:25,506 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:13:25,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:25,696 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:25,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1097749168, now seen corresponding path program 2 times [2022-04-27 11:13:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:25,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19585276] [2022-04-27 11:13:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:25,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:25,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-27 11:13:25,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-27 11:13:25,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5571#true} {5571#true} #83#return; {5571#true} is VALID [2022-04-27 11:13:25,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:25,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-27 11:13:25,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-27 11:13:25,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5571#true} {5571#true} #83#return; {5571#true} is VALID [2022-04-27 11:13:25,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#true} call #t~ret15 := main(); {5571#true} is VALID [2022-04-27 11:13:25,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {5571#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5571#true} is VALID [2022-04-27 11:13:25,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {5571#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5571#true} is VALID [2022-04-27 11:13:25,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {5571#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:25,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:25,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:25,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:25,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:25,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:25,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:25,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:25,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:25,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:25,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {5572#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {5572#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#false} assume !(~z~0 % 4294967296 > 0); {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L272 TraceCheckUtils]: 21: Hoare triple {5572#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-27 11:13:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:25,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19585276] [2022-04-27 11:13:25,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19585276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:25,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726586211] [2022-04-27 11:13:25,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:13:25,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:25,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:25,772 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:13:25,798 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:13:25,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:13:25,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:25,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:13:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:25,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:26,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-27 11:13:26,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-27 11:13:26,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-27 11:13:26,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5571#true} {5571#true} #83#return; {5571#true} is VALID [2022-04-27 11:13:26,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#true} call #t~ret15 := main(); {5571#true} is VALID [2022-04-27 11:13:26,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {5571#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5571#true} is VALID [2022-04-27 11:13:26,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {5571#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5571#true} is VALID [2022-04-27 11:13:26,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {5571#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:26,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:26,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:26,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5572#false} is VALID [2022-04-27 11:13:26,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {5572#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5572#false} is VALID [2022-04-27 11:13:26,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {5572#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5572#false} is VALID [2022-04-27 11:13:26,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#false} assume !(~z~0 % 4294967296 > 0); {5572#false} is VALID [2022-04-27 11:13:26,105 INFO L272 TraceCheckUtils]: 21: Hoare triple {5572#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5572#false} is VALID [2022-04-27 11:13:26,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-27 11:13:26,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-27 11:13:26,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-27 11:13:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:26,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:26,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-27 11:13:26,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-27 11:13:26,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-27 11:13:26,341 INFO L272 TraceCheckUtils]: 21: Hoare triple {5572#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5572#false} is VALID [2022-04-27 11:13:26,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {5572#false} assume !(~z~0 % 4294967296 > 0); {5572#false} is VALID [2022-04-27 11:13:26,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {5572#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5572#false} is VALID [2022-04-27 11:13:26,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {5572#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5572#false} is VALID [2022-04-27 11:13:26,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5572#false} is VALID [2022-04-27 11:13:26,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5578#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5577#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:13:26,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:26,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:26,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {5571#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5576#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:13:26,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {5571#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5571#true} is VALID [2022-04-27 11:13:26,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {5571#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5571#true} is VALID [2022-04-27 11:13:26,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#true} call #t~ret15 := main(); {5571#true} is VALID [2022-04-27 11:13:26,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5571#true} {5571#true} #83#return; {5571#true} is VALID [2022-04-27 11:13:26,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-27 11:13:26,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-27 11:13:26,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-27 11:13:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:13:26,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726586211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:26,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:26,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-27 11:13:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987681448] [2022-04-27 11:13:26,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:26,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:26,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:26,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:13:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:26,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:13:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:13:26,370 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:26,820 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2022-04-27 11:13:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:13:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:13:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 11:13:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 11:13:26,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 11:13:26,885 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:13:26,886 INFO L225 Difference]: With dead ends: 122 [2022-04-27 11:13:26,886 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 11:13:26,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:13:26,887 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:26,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:13:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 11:13:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-27 11:13:27,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:27,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:27,038 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:27,038 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:27,040 INFO L93 Difference]: Finished difference Result 113 states and 154 transitions. [2022-04-27 11:13:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2022-04-27 11:13:27,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:27,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:27,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-27 11:13:27,041 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-27 11:13:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:27,043 INFO L93 Difference]: Finished difference Result 113 states and 154 transitions. [2022-04-27 11:13:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2022-04-27 11:13:27,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:27,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:27,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:27,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2022-04-27 11:13:27,046 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 25 [2022-04-27 11:13:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:27,046 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2022-04-27 11:13:27,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2022-04-27 11:13:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:13:27,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:27,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:27,068 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:13:27,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 11:13:27,263 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1115860192, now seen corresponding path program 3 times [2022-04-27 11:13:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:27,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71496260] [2022-04-27 11:13:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:27,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:27,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {6304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6290#true} is VALID [2022-04-27 11:13:27,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {6290#true} assume true; {6290#true} is VALID [2022-04-27 11:13:27,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6290#true} {6290#true} #83#return; {6290#true} is VALID [2022-04-27 11:13:27,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {6290#true} call ULTIMATE.init(); {6304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:27,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {6304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6290#true} is VALID [2022-04-27 11:13:27,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {6290#true} assume true; {6290#true} is VALID [2022-04-27 11:13:27,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6290#true} {6290#true} #83#return; {6290#true} is VALID [2022-04-27 11:13:27,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {6290#true} call #t~ret15 := main(); {6290#true} is VALID [2022-04-27 11:13:27,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {6290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6295#(= main_~y~0 0)} is VALID [2022-04-27 11:13:27,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {6295#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:27,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {6296#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:27,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {6297#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:27,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {6298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:27,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {6298#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {6299#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:13:27,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {6299#(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; {6300#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:27,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {6300#(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; {6301#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:27,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {6301#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6302#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:27,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {6302#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6302#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:13:27,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {6302#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6301#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:13:27,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {6301#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6300#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:13:27,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {6300#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6303#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:27,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {6303#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {6303#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:27,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {6303#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {6303#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:13:27,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {6303#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6291#false} is VALID [2022-04-27 11:13:27,434 INFO L272 TraceCheckUtils]: 21: Hoare triple {6291#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6291#false} is VALID [2022-04-27 11:13:27,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {6291#false} ~cond := #in~cond; {6291#false} is VALID [2022-04-27 11:13:27,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {6291#false} assume 0 == ~cond; {6291#false} is VALID [2022-04-27 11:13:27,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {6291#false} assume !false; {6291#false} is VALID [2022-04-27 11:13:27,434 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:13:27,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:27,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71496260] [2022-04-27 11:13:27,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71496260] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:27,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011514375] [2022-04-27 11:13:27,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:27,435 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:13:27,436 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:13:27,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:13:27,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:27,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 11:13:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:27,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:27,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {6290#true} call ULTIMATE.init(); {6290#true} is VALID [2022-04-27 11:13:27,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {6290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6290#true} is VALID [2022-04-27 11:13:27,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {6290#true} assume true; {6290#true} is VALID [2022-04-27 11:13:27,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6290#true} {6290#true} #83#return; {6290#true} is VALID [2022-04-27 11:13:27,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {6290#true} call #t~ret15 := main(); {6290#true} is VALID [2022-04-27 11:13:27,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {6290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6290#true} is VALID [2022-04-27 11:13:27,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {6290#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:27,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:27,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:27,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:27,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:27,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:27,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:27,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6291#false} is VALID [2022-04-27 11:13:27,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {6291#false} assume !(~z~0 % 4294967296 > 0); {6291#false} is VALID [2022-04-27 11:13:27,618 INFO L272 TraceCheckUtils]: 21: Hoare triple {6291#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6291#false} is VALID [2022-04-27 11:13:27,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {6291#false} ~cond := #in~cond; {6291#false} is VALID [2022-04-27 11:13:27,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {6291#false} assume 0 == ~cond; {6291#false} is VALID [2022-04-27 11:13:27,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {6291#false} assume !false; {6291#false} is VALID [2022-04-27 11:13:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:27,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:27,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {6291#false} assume !false; {6291#false} is VALID [2022-04-27 11:13:27,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {6291#false} assume 0 == ~cond; {6291#false} is VALID [2022-04-27 11:13:27,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {6291#false} ~cond := #in~cond; {6291#false} is VALID [2022-04-27 11:13:27,715 INFO L272 TraceCheckUtils]: 21: Hoare triple {6291#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6291#false} is VALID [2022-04-27 11:13:27,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {6291#false} assume !(~z~0 % 4294967296 > 0); {6291#false} is VALID [2022-04-27 11:13:27,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6291#false} is VALID [2022-04-27 11:13:27,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {6350#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6350#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:13:27,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:27,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:27,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:27,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:27,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6334#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:13:27,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6330#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:13:27,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {6290#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6326#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:13:27,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {6290#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6290#true} is VALID [2022-04-27 11:13:27,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {6290#true} call #t~ret15 := main(); {6290#true} is VALID [2022-04-27 11:13:27,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6290#true} {6290#true} #83#return; {6290#true} is VALID [2022-04-27 11:13:27,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {6290#true} assume true; {6290#true} is VALID [2022-04-27 11:13:27,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {6290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6290#true} is VALID [2022-04-27 11:13:27,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {6290#true} call ULTIMATE.init(); {6290#true} is VALID [2022-04-27 11:13:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:13:27,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011514375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:27,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:27,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-27 11:13:27,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019669201] [2022-04-27 11:13:27,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:27,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:13:27,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:27,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:13:27,760 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:13:27,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:13:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:13:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:13:27,761 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:13:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:30,919 INFO L93 Difference]: Finished difference Result 190 states and 270 transitions. [2022-04-27 11:13:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 11:13:30,919 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:13:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:13:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 161 transitions. [2022-04-27 11:13:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:13:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 161 transitions. [2022-04-27 11:13:30,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 161 transitions. [2022-04-27 11:13:31,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:31,151 INFO L225 Difference]: With dead ends: 190 [2022-04-27 11:13:31,151 INFO L226 Difference]: Without dead ends: 171 [2022-04-27 11:13:31,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=480, Invalid=2942, Unknown=0, NotChecked=0, Total=3422 [2022-04-27 11:13:31,152 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 140 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:31,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 84 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:13:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-27 11:13:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 118. [2022-04-27 11:13:31,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:31,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 118 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 3 states have call successors, (3), 3 states 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:13:31,355 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 118 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 3 states have call successors, (3), 3 states 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:13:31,356 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 118 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 3 states have call successors, (3), 3 states 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:13:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:31,359 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2022-04-27 11:13:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 228 transitions. [2022-04-27 11:13:31,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:31,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:31,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states. [2022-04-27 11:13:31,360 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 171 states. [2022-04-27 11:13:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:31,363 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2022-04-27 11:13:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 228 transitions. [2022-04-27 11:13:31,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:31,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:31,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:31,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 3 states have call successors, (3), 3 states 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:13:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 160 transitions. [2022-04-27 11:13:31,365 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 160 transitions. Word has length 25 [2022-04-27 11:13:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:31,366 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 160 transitions. [2022-04-27 11:13:31,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:13:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2022-04-27 11:13:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:13:31,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:31,372 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:31,396 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:13:31,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 11:13:31,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:31,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 3 times [2022-04-27 11:13:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:31,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952472991] [2022-04-27 11:13:31,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:31,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {7324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7310#true} is VALID [2022-04-27 11:13:31,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {7310#true} assume true; {7310#true} is VALID [2022-04-27 11:13:31,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7310#true} {7310#true} #83#return; {7310#true} is VALID [2022-04-27 11:13:31,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {7310#true} call ULTIMATE.init(); {7324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:31,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {7324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7310#true} is VALID [2022-04-27 11:13:31,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {7310#true} assume true; {7310#true} is VALID [2022-04-27 11:13:31,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7310#true} {7310#true} #83#return; {7310#true} is VALID [2022-04-27 11:13:31,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {7310#true} call #t~ret15 := main(); {7310#true} is VALID [2022-04-27 11:13:31,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {7310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:31,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7316#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-27 11:13:31,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {7316#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:31,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:13:31,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:13:31,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7319#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:13:31,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {7319#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-27 11:13:31,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-27 11:13:31,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-27 11:13:31,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-27 11:13:31,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !(~y~0 % 4294967296 > 0); {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} is VALID [2022-04-27 11:13:31,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {7320#(and (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 2) main_~x~0) (<= main_~x~0 main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7319#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:13:31,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {7319#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:13:31,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-27 11:13:31,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {7318#(and (<= (+ main_~x~0 2) main_~n~0) (<= (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7319#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-27 11:13:31,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {7319#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~n~0 4294967293) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:31,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:31,849 INFO L272 TraceCheckUtils]: 22: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7322#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:13:31,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {7322#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7323#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:13:31,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {7323#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7311#false} is VALID [2022-04-27 11:13:31,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {7311#false} assume !false; {7311#false} is VALID [2022-04-27 11:13:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:31,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952472991] [2022-04-27 11:13:31,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952472991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:31,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680739150] [2022-04-27 11:13:31,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:31,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:31,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:31,851 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:13:31,852 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:13:31,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:13:31,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:31,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 11:13:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:31,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:32,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {7310#true} call ULTIMATE.init(); {7310#true} is VALID [2022-04-27 11:13:32,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {7310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7310#true} is VALID [2022-04-27 11:13:32,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {7310#true} assume true; {7310#true} is VALID [2022-04-27 11:13:32,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7310#true} {7310#true} #83#return; {7310#true} is VALID [2022-04-27 11:13:32,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {7310#true} call #t~ret15 := main(); {7310#true} is VALID [2022-04-27 11:13:32,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {7310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:13:32,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:32,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:32,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:32,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= 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; {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:13:32,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) 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; {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) 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; {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:13:32,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:32,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:13:32,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {7317#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:13:32,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {7346#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:13:32,080 INFO L272 TraceCheckUtils]: 22: Hoare triple {7315#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7395#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:32,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {7395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7399#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:32,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {7399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7311#false} is VALID [2022-04-27 11:13:32,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {7311#false} assume !false; {7311#false} is VALID [2022-04-27 11:13:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:32,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:32,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {7311#false} assume !false; {7311#false} is VALID [2022-04-27 11:13:32,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {7399#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7311#false} is VALID [2022-04-27 11:13:32,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {7395#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7399#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:13:32,382 INFO L272 TraceCheckUtils]: 22: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7395#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:13:32,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (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; {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} ~z~0 := ~y~0; {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {7425#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7421#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:13:32,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {7310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7321#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:13:32,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {7310#true} call #t~ret15 := main(); {7310#true} is VALID [2022-04-27 11:13:32,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7310#true} {7310#true} #83#return; {7310#true} is VALID [2022-04-27 11:13:32,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {7310#true} assume true; {7310#true} is VALID [2022-04-27 11:13:32,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {7310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7310#true} is VALID [2022-04-27 11:13:32,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {7310#true} call ULTIMATE.init(); {7310#true} is VALID [2022-04-27 11:13:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:13:32,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680739150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:32,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:32,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-04-27 11:13:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163507410] [2022-04-27 11:13:32,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:32,397 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 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 26 [2022-04-27 11:13:32,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:32,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 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:13:32,459 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:13:32,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:13:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:32,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:13:32,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:13:32,460 INFO L87 Difference]: Start difference. First operand 118 states and 160 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 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:13:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:33,353 INFO L93 Difference]: Finished difference Result 133 states and 175 transitions. [2022-04-27 11:13:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:13:33,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 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 26 [2022-04-27 11:13:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:13:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 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:13:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-27 11:13:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 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:13:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-27 11:13:33,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 49 transitions. [2022-04-27 11:13:33,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:13:33,407 INFO L225 Difference]: With dead ends: 133 [2022-04-27 11:13:33,407 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 11:13:33,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:13:33,408 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:13:33,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:13:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 11:13:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-27 11:13:33,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:13:33,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:33,604 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:33,604 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:33,606 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2022-04-27 11:13:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2022-04-27 11:13:33,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:33,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:33,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-27 11:13:33,607 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-27 11:13:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:13:33,609 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2022-04-27 11:13:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2022-04-27 11:13:33,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:13:33,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:13:33,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:13:33,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:13:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 103 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:13:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2022-04-27 11:13:33,611 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 26 [2022-04-27 11:13:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:13:33,611 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2022-04-27 11:13:33,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 14 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:13:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2022-04-27 11:13:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:13:33,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:13:33,612 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:13:33,637 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:13:33,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 11:13:33,813 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:13:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:13:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1003454959, now seen corresponding path program 3 times [2022-04-27 11:13:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:13:33,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309314016] [2022-04-27 11:13:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:13:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:13:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:13:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:34,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {8079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-27 11:13:34,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-27 11:13:34,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8061#true} {8061#true} #83#return; {8061#true} is VALID [2022-04-27 11:13:34,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {8061#true} call ULTIMATE.init(); {8079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:13:34,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {8079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-27 11:13:34,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-27 11:13:34,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8061#true} {8061#true} #83#return; {8061#true} is VALID [2022-04-27 11:13:34,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {8061#true} call #t~ret15 := main(); {8061#true} is VALID [2022-04-27 11:13:34,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {8061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8066#(= main_~y~0 0)} is VALID [2022-04-27 11:13:34,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {8066#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8067#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:34,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {8067#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8068#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:34,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {8068#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:34,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8070#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:34,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {8070#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8071#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:34,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {8071#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8072#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:34,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {8072#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8073#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:34,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {8073#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8074#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:13:34,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {8074#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8075#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:13:34,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {8075#(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; {8076#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:13:34,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {8076#(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; {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:34,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:34,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {8078#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:13:34,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {8078#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {8062#false} assume !(~y~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {8062#false} assume !(~x~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {8062#false} assume !(~z~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L272 TraceCheckUtils]: 23: Hoare triple {8062#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {8062#false} ~cond := #in~cond; {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {8062#false} assume 0 == ~cond; {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {8062#false} assume !false; {8062#false} is VALID [2022-04-27 11:13:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:13:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309314016] [2022-04-27 11:13:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309314016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:13:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676998321] [2022-04-27 11:13:34,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:13:34,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:13:34,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:13:34,048 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:13:34,056 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:13:34,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-27 11:13:34,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:13:34,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-27 11:13:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:13:34,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:13:34,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {8061#true} call ULTIMATE.init(); {8061#true} is VALID [2022-04-27 11:13:34,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-27 11:13:34,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-27 11:13:34,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8061#true} {8061#true} #83#return; {8061#true} is VALID [2022-04-27 11:13:34,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {8061#true} call #t~ret15 := main(); {8061#true} is VALID [2022-04-27 11:13:34,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {8061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8066#(= main_~y~0 0)} is VALID [2022-04-27 11:13:34,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {8066#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8067#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:13:34,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {8067#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8068#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:13:34,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {8068#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:13:34,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {8069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8070#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:13:34,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {8070#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8071#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:13:34,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {8071#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8072#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:13:34,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {8072#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8073#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:13:34,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {8073#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8074#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:13:34,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {8074#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8075#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:13:34,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {8075#(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; {8076#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:13:34,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {8076#(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; {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:34,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:13:34,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {8077#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {8137#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:13:34,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {8137#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {8062#false} assume !(~y~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {8062#false} assume !(~x~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {8062#false} assume !(~z~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L272 TraceCheckUtils]: 23: Hoare triple {8062#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {8062#false} ~cond := #in~cond; {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {8062#false} assume 0 == ~cond; {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {8062#false} assume !false; {8062#false} is VALID [2022-04-27 11:13:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:34,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:13:34,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {8062#false} assume !false; {8062#false} is VALID [2022-04-27 11:13:34,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {8062#false} assume 0 == ~cond; {8062#false} is VALID [2022-04-27 11:13:34,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {8062#false} ~cond := #in~cond; {8062#false} is VALID [2022-04-27 11:13:34,750 INFO L272 TraceCheckUtils]: 23: Hoare triple {8062#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8062#false} is VALID [2022-04-27 11:13:34,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {8062#false} assume !(~z~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {8062#false} assume !(~x~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {8062#false} assume !(~y~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {8183#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8062#false} is VALID [2022-04-27 11:13:34,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {8187#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {8183#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:13:34,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {8187#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8187#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:34,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {8194#(< 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; {8187#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:13:34,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {8198#(< 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; {8194#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:13:34,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {8202#(< 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; {8198#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:13:34,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {8206#(< 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; {8202#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:13:34,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {8210#(< 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; {8206#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:13:34,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {8214#(< 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; {8210#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:34,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {8218#(< 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; {8214#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:13:34,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {8222#(< 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; {8218#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:13:34,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {8226#(< 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; {8222#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:13:34,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {8230#(< 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; {8226#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:13:34,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {8234#(< 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; {8230#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:13:34,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {8061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8234#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:13:34,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {8061#true} call #t~ret15 := main(); {8061#true} is VALID [2022-04-27 11:13:34,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8061#true} {8061#true} #83#return; {8061#true} is VALID [2022-04-27 11:13:34,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-27 11:13:34,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8061#true} is VALID [2022-04-27 11:13:34,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {8061#true} call ULTIMATE.init(); {8061#true} is VALID [2022-04-27 11:13:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:13:34,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676998321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:13:34,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:13:34,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-27 11:13:34,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968591750] [2022-04-27 11:13:34,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:13:34,768 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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 27 [2022-04-27 11:13:34,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:13:34,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:13:34,796 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:13:34,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-27 11:13:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:13:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-27 11:13:34,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:13:34,797 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:14:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:07,076 INFO L93 Difference]: Finished difference Result 601 states and 923 transitions. [2022-04-27 11:14:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-27 11:14:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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 27 [2022-04-27 11:14:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:14:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 368 transitions. [2022-04-27 11:14:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:14:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 368 transitions. [2022-04-27 11:14:07,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 368 transitions. [2022-04-27 11:14:10,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 367 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:10,840 INFO L225 Difference]: With dead ends: 601 [2022-04-27 11:14:10,840 INFO L226 Difference]: Without dead ends: 579 [2022-04-27 11:14:10,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=1927, Invalid=5555, Unknown=0, NotChecked=0, Total=7482 [2022-04-27 11:14:10,842 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1141 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:10,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 142 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-27 11:14:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-04-27 11:14:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 167. [2022-04-27 11:14:11,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:11,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 579 states. Second operand has 167 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 162 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,232 INFO L74 IsIncluded]: Start isIncluded. First operand 579 states. Second operand has 167 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 162 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,232 INFO L87 Difference]: Start difference. First operand 579 states. Second operand has 167 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 162 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:11,249 INFO L93 Difference]: Finished difference Result 579 states and 811 transitions. [2022-04-27 11:14:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 811 transitions. [2022-04-27 11:14:11,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:11,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:11,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 162 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-27 11:14:11,251 INFO L87 Difference]: Start difference. First operand has 167 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 162 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-27 11:14:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:11,268 INFO L93 Difference]: Finished difference Result 579 states and 811 transitions. [2022-04-27 11:14:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 811 transitions. [2022-04-27 11:14:11,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:11,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:11,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:11,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.3950617283950617) internal successors, (226), 162 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 230 transitions. [2022-04-27 11:14:11,273 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 230 transitions. Word has length 27 [2022-04-27 11:14:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:11,273 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 230 transitions. [2022-04-27 11:14:11,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 29 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:14:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2022-04-27 11:14:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:14:11,274 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:11,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:11,299 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:14:11,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 11:14:11,496 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2128187618, now seen corresponding path program 3 times [2022-04-27 11:14:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243160691] [2022-04-27 11:14:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:11,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {10561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10547#true} is VALID [2022-04-27 11:14:11,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {10547#true} assume true; {10547#true} is VALID [2022-04-27 11:14:11,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10547#true} {10547#true} #83#return; {10547#true} is VALID [2022-04-27 11:14:11,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {10547#true} call ULTIMATE.init(); {10561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:11,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {10561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10547#true} is VALID [2022-04-27 11:14:11,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {10547#true} assume true; {10547#true} is VALID [2022-04-27 11:14:11,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10547#true} {10547#true} #83#return; {10547#true} is VALID [2022-04-27 11:14:11,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {10547#true} call #t~ret15 := main(); {10547#true} is VALID [2022-04-27 11:14:11,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {10547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10552#(= main_~y~0 0)} is VALID [2022-04-27 11:14:11,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {10552#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:11,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {10553#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:11,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {10554#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:11,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {10555#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:11,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {10556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:11,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {10556#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {10557#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:11,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {10557#(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; {10558#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:11,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {10558#(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; {10559#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:11,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {10559#(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; {10560#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:11,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {10560#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {10548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {10548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {10548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {10548#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {10548#false} assume !(~y~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {10548#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {10548#false} assume !(~x~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {10548#false} assume !(~z~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L272 TraceCheckUtils]: 24: Hoare triple {10548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {10548#false} ~cond := #in~cond; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {10548#false} assume 0 == ~cond; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {10548#false} assume !false; {10548#false} is VALID [2022-04-27 11:14:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 11:14:11,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:11,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243160691] [2022-04-27 11:14:11,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243160691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:11,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126967031] [2022-04-27 11:14:11,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:14:11,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:11,680 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:14:11,681 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:14:11,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 11:14:11,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:11,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:14:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:11,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:11,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {10547#true} call ULTIMATE.init(); {10547#true} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {10547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10547#true} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {10547#true} assume true; {10547#true} is VALID [2022-04-27 11:14:11,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10547#true} {10547#true} #83#return; {10547#true} is VALID [2022-04-27 11:14:11,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {10547#true} call #t~ret15 := main(); {10547#true} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {10547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10547#true} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {10547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10547#true} is VALID [2022-04-27 11:14:11,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {10547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10547#true} is VALID [2022-04-27 11:14:11,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {10547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:11,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:11,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:11,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:11,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:11,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10606#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:11,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {10606#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10606#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:11,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {10606#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {10548#false} assume !(~z~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,895 INFO L272 TraceCheckUtils]: 24: Hoare triple {10548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10548#false} is VALID [2022-04-27 11:14:11,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {10548#false} ~cond := #in~cond; {10548#false} is VALID [2022-04-27 11:14:11,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {10548#false} assume 0 == ~cond; {10548#false} is VALID [2022-04-27 11:14:11,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {10548#false} assume !false; {10548#false} is VALID [2022-04-27 11:14:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 11:14:11,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:11,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {10548#false} assume !false; {10548#false} is VALID [2022-04-27 11:14:11,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {10548#false} assume 0 == ~cond; {10548#false} is VALID [2022-04-27 11:14:11,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {10548#false} ~cond := #in~cond; {10548#false} is VALID [2022-04-27 11:14:11,975 INFO L272 TraceCheckUtils]: 24: Hoare triple {10548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10548#false} is VALID [2022-04-27 11:14:11,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {10548#false} assume !(~z~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {10606#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {10548#false} is VALID [2022-04-27 11:14:11,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10606#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:11,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {10610#(< 0 (mod (+ main_~x~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; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {10606#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10610#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:11,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10606#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:11,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:11,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:11,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:11,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10593#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:11,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {10547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10589#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:11,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {10547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {10547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {10547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {10547#true} call #t~ret15 := main(); {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10547#true} {10547#true} #83#return; {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {10547#true} assume true; {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {10547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {10547#true} call ULTIMATE.init(); {10547#true} is VALID [2022-04-27 11:14:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 11:14:11,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126967031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:11,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:11,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-27 11:14:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403139438] [2022-04-27 11:14:11,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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 28 [2022-04-27 11:14:11,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:11,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:14:12,009 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:14:12,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:14:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:14:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:14:12,010 INFO L87 Difference]: Start difference. First operand 167 states and 230 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:14:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:16,073 INFO L93 Difference]: Finished difference Result 279 states and 387 transitions. [2022-04-27 11:14:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-27 11:14:16,073 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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 28 [2022-04-27 11:14:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:14:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 185 transitions. [2022-04-27 11:14:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:14:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 185 transitions. [2022-04-27 11:14:16,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 185 transitions. [2022-04-27 11:14:16,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:16,275 INFO L225 Difference]: With dead ends: 279 [2022-04-27 11:14:16,276 INFO L226 Difference]: Without dead ends: 262 [2022-04-27 11:14:16,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=415, Invalid=2891, Unknown=0, NotChecked=0, Total=3306 [2022-04-27 11:14:16,277 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 155 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:16,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 119 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:14:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-27 11:14:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 155. [2022-04-27 11:14:16,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:16,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 155 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:16,684 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 155 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:16,684 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 155 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:16,689 INFO L93 Difference]: Finished difference Result 262 states and 365 transitions. [2022-04-27 11:14:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 365 transitions. [2022-04-27 11:14:16,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:16,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:16,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-27 11:14:16,690 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-27 11:14:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:16,695 INFO L93 Difference]: Finished difference Result 262 states and 365 transitions. [2022-04-27 11:14:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 365 transitions. [2022-04-27 11:14:16,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:16,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:16,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:16,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 215 transitions. [2022-04-27 11:14:16,698 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 215 transitions. Word has length 28 [2022-04-27 11:14:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:16,699 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 215 transitions. [2022-04-27 11:14:16,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 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:14:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 215 transitions. [2022-04-27 11:14:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:14:16,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:16,699 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:16,733 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:14:16,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 11:14:16,930 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash 401313666, now seen corresponding path program 4 times [2022-04-27 11:14:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:16,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357985135] [2022-04-27 11:14:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:17,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {11998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11982#true} is VALID [2022-04-27 11:14:17,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {11982#true} assume true; {11982#true} is VALID [2022-04-27 11:14:17,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11982#true} {11982#true} #83#return; {11982#true} is VALID [2022-04-27 11:14:17,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {11982#true} call ULTIMATE.init(); {11998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:17,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {11998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11982#true} is VALID [2022-04-27 11:14:17,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {11982#true} assume true; {11982#true} is VALID [2022-04-27 11:14:17,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11982#true} {11982#true} #83#return; {11982#true} is VALID [2022-04-27 11:14:17,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {11982#true} call #t~ret15 := main(); {11982#true} is VALID [2022-04-27 11:14:17,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {11982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11987#(= main_~y~0 0)} is VALID [2022-04-27 11:14:17,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {11987#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:17,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {11988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:17,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {11989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:17,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {11990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:17,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {11991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:17,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {11991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {11992#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:17,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {11992#(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; {11993#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:17,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {11993#(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; {11994#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:17,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {11994#(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; {11995#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:17,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {11995#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11996#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:14:17,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {11996#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11996#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:14:17,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {11996#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11995#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:17,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {11995#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11994#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:17,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {11994#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11993#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:17,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {11993#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11997#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:17,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {11997#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {11997#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:17,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {11997#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {11997#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:17,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {11997#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11983#false} is VALID [2022-04-27 11:14:17,114 INFO L272 TraceCheckUtils]: 24: Hoare triple {11983#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11983#false} is VALID [2022-04-27 11:14:17,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {11983#false} ~cond := #in~cond; {11983#false} is VALID [2022-04-27 11:14:17,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {11983#false} assume 0 == ~cond; {11983#false} is VALID [2022-04-27 11:14:17,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {11983#false} assume !false; {11983#false} is VALID [2022-04-27 11:14:17,114 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:14:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:17,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357985135] [2022-04-27 11:14:17,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357985135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:17,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50109596] [2022-04-27 11:14:17,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:14:17,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:17,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:17,116 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:14:17,116 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:14:17,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:14:17,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:17,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:14:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:17,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:17,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {11982#true} call ULTIMATE.init(); {11982#true} is VALID [2022-04-27 11:14:17,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {11982#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11982#true} is VALID [2022-04-27 11:14:17,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {11982#true} assume true; {11982#true} is VALID [2022-04-27 11:14:17,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11982#true} {11982#true} #83#return; {11982#true} is VALID [2022-04-27 11:14:17,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {11982#true} call #t~ret15 := main(); {11982#true} is VALID [2022-04-27 11:14:17,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {11982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11982#true} is VALID [2022-04-27 11:14:17,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {11982#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:17,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:17,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:17,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:17,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:17,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:17,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:17,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:17,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:17,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11983#false} is VALID [2022-04-27 11:14:17,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {11983#false} assume !(~z~0 % 4294967296 > 0); {11983#false} is VALID [2022-04-27 11:14:17,325 INFO L272 TraceCheckUtils]: 24: Hoare triple {11983#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11983#false} is VALID [2022-04-27 11:14:17,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {11983#false} ~cond := #in~cond; {11983#false} is VALID [2022-04-27 11:14:17,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {11983#false} assume 0 == ~cond; {11983#false} is VALID [2022-04-27 11:14:17,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {11983#false} assume !false; {11983#false} is VALID [2022-04-27 11:14:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:17,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:17,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {11983#false} assume !false; {11983#false} is VALID [2022-04-27 11:14:17,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {11983#false} assume 0 == ~cond; {11983#false} is VALID [2022-04-27 11:14:17,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {11983#false} ~cond := #in~cond; {11983#false} is VALID [2022-04-27 11:14:17,423 INFO L272 TraceCheckUtils]: 24: Hoare triple {11983#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11983#false} is VALID [2022-04-27 11:14:17,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {11983#false} assume !(~z~0 % 4294967296 > 0); {11983#false} is VALID [2022-04-27 11:14:17,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11983#false} is VALID [2022-04-27 11:14:17,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {12051#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12051#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:17,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:17,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:17,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:17,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:17,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:17,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12032#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:17,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12028#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:17,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12024#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:17,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {11982#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12020#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:17,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {11982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11982#true} is VALID [2022-04-27 11:14:17,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {11982#true} call #t~ret15 := main(); {11982#true} is VALID [2022-04-27 11:14:17,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11982#true} {11982#true} #83#return; {11982#true} is VALID [2022-04-27 11:14:17,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {11982#true} assume true; {11982#true} is VALID [2022-04-27 11:14:17,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {11982#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11982#true} is VALID [2022-04-27 11:14:17,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {11982#true} call ULTIMATE.init(); {11982#true} is VALID [2022-04-27 11:14:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:14:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50109596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:17,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:17,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-27 11:14:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204632409] [2022-04-27 11:14:17,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:17,435 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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:14:17,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:17,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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:14:17,468 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:14:17,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:14:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:14:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:14:17,469 INFO L87 Difference]: Start difference. First operand 155 states and 215 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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:14:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:24,304 INFO L93 Difference]: Finished difference Result 294 states and 418 transitions. [2022-04-27 11:14:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-27 11:14:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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:14:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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:14:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 206 transitions. [2022-04-27 11:14:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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:14:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 206 transitions. [2022-04-27 11:14:24,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 206 transitions. [2022-04-27 11:14:24,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:24,668 INFO L225 Difference]: With dead ends: 294 [2022-04-27 11:14:24,668 INFO L226 Difference]: Without dead ends: 280 [2022-04-27 11:14:24,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=840, Invalid=6300, Unknown=0, NotChecked=0, Total=7140 [2022-04-27 11:14:24,670 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 179 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:24,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 108 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 11:14:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-27 11:14:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 185. [2022-04-27 11:14:25,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:25,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 185 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,126 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 185 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,126 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 185 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:25,131 INFO L93 Difference]: Finished difference Result 280 states and 373 transitions. [2022-04-27 11:14:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2022-04-27 11:14:25,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:25,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:25,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 11:14:25,132 INFO L87 Difference]: Start difference. First operand has 185 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 280 states. [2022-04-27 11:14:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:25,137 INFO L93 Difference]: Finished difference Result 280 states and 373 transitions. [2022-04-27 11:14:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2022-04-27 11:14:25,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:25,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:25,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:25,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 256 transitions. [2022-04-27 11:14:25,142 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 256 transitions. Word has length 28 [2022-04-27 11:14:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:25,142 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 256 transitions. [2022-04-27 11:14:25,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 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:14:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 256 transitions. [2022-04-27 11:14:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 11:14:25,143 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:25,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:25,165 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:14:25,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:14:25,359 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:25,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1456672573, now seen corresponding path program 4 times [2022-04-27 11:14:25,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:25,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928501776] [2022-04-27 11:14:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:25,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:25,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {13556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13547#true} is VALID [2022-04-27 11:14:25,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {13547#true} assume true; {13547#true} is VALID [2022-04-27 11:14:25,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13547#true} {13547#true} #83#return; {13547#true} is VALID [2022-04-27 11:14:25,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {13547#true} call ULTIMATE.init(); {13556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:25,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {13556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13547#true} is VALID [2022-04-27 11:14:25,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {13547#true} assume true; {13547#true} is VALID [2022-04-27 11:14:25,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13547#true} {13547#true} #83#return; {13547#true} is VALID [2022-04-27 11:14:25,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {13547#true} call #t~ret15 := main(); {13547#true} is VALID [2022-04-27 11:14:25,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {13547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13547#true} is VALID [2022-04-27 11:14:25,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13547#true} is VALID [2022-04-27 11:14:25,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13547#true} is VALID [2022-04-27 11:14:25,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {13548#false} assume !(~z~0 % 4294967296 > 0); {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L272 TraceCheckUtils]: 26: Hoare triple {13548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {13548#false} ~cond := #in~cond; {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {13548#false} assume 0 == ~cond; {13548#false} is VALID [2022-04-27 11:14:25,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {13548#false} assume !false; {13548#false} is VALID [2022-04-27 11:14:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928501776] [2022-04-27 11:14:25,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928501776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642667870] [2022-04-27 11:14:25,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:14:25,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:25,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:25,497 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:14:25,503 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:14:25,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:14:25,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:25,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:14:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:25,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:25,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {13547#true} call ULTIMATE.init(); {13547#true} is VALID [2022-04-27 11:14:25,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {13547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13547#true} is VALID [2022-04-27 11:14:25,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {13547#true} assume true; {13547#true} is VALID [2022-04-27 11:14:25,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13547#true} {13547#true} #83#return; {13547#true} is VALID [2022-04-27 11:14:25,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {13547#true} call #t~ret15 := main(); {13547#true} is VALID [2022-04-27 11:14:25,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {13547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13547#true} is VALID [2022-04-27 11:14:25,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13547#true} is VALID [2022-04-27 11:14:25,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13547#true} is VALID [2022-04-27 11:14:25,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {13548#false} assume !(~z~0 % 4294967296 > 0); {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L272 TraceCheckUtils]: 26: Hoare triple {13548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {13548#false} ~cond := #in~cond; {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {13548#false} assume 0 == ~cond; {13548#false} is VALID [2022-04-27 11:14:25,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {13548#false} assume !false; {13548#false} is VALID [2022-04-27 11:14:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:25,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:25,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {13548#false} assume !false; {13548#false} is VALID [2022-04-27 11:14:25,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {13548#false} assume 0 == ~cond; {13548#false} is VALID [2022-04-27 11:14:25,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {13548#false} ~cond := #in~cond; {13548#false} is VALID [2022-04-27 11:14:25,881 INFO L272 TraceCheckUtils]: 26: Hoare triple {13548#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13548#false} is VALID [2022-04-27 11:14:25,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {13548#false} assume !(~z~0 % 4294967296 > 0); {13548#false} is VALID [2022-04-27 11:14:25,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {13548#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13548#false} is VALID [2022-04-27 11:14:25,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13548#false} is VALID [2022-04-27 11:14:25,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13555#(<= main_~x~0 (+ 4294967297 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13554#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13553#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:14:25,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13552#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-27 11:14:25,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {13547#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {13547#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {13547#true} call #t~ret15 := main(); {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13547#true} {13547#true} #83#return; {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {13547#true} assume true; {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {13547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {13547#true} call ULTIMATE.init(); {13547#true} is VALID [2022-04-27 11:14:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:25,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642667870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:25,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:25,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-27 11:14:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791260483] [2022-04-27 11:14:25,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:25,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:14:25,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:25,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:14:25,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:25,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:14:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:25,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:14:25,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:14:25,912 INFO L87 Difference]: Start difference. First operand 185 states and 256 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:14:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:26,878 INFO L93 Difference]: Finished difference Result 238 states and 321 transitions. [2022-04-27 11:14:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:14:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:14:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:14:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-27 11:14:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:14:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-27 11:14:26,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-04-27 11:14:26,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:26,949 INFO L225 Difference]: With dead ends: 238 [2022-04-27 11:14:26,949 INFO L226 Difference]: Without dead ends: 228 [2022-04-27 11:14:26,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:14:26,949 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:26,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 51 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:14:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-04-27 11:14:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 207. [2022-04-27 11:14:27,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:27,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 207 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 202 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:27,420 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 207 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 202 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:27,420 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 207 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 202 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:27,424 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2022-04-27 11:14:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2022-04-27 11:14:27,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:27,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:27,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 202 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-27 11:14:27,425 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 202 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 228 states. [2022-04-27 11:14:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:27,428 INFO L93 Difference]: Finished difference Result 228 states and 308 transitions. [2022-04-27 11:14:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2022-04-27 11:14:27,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:27,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:27,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:27,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.3712871287128714) internal successors, (277), 202 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2022-04-27 11:14:27,433 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 30 [2022-04-27 11:14:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:27,433 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2022-04-27 11:14:27,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:14:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2022-04-27 11:14:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:14:27,433 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:27,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:27,465 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:14:27,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:27,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 5 times [2022-04-27 11:14:27,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:27,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694334169] [2022-04-27 11:14:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:28,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {14862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14846#true} is VALID [2022-04-27 11:14:28,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {14846#true} assume true; {14846#true} is VALID [2022-04-27 11:14:28,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14846#true} {14846#true} #83#return; {14846#true} is VALID [2022-04-27 11:14:28,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {14846#true} call ULTIMATE.init(); {14862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:28,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {14862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14846#true} is VALID [2022-04-27 11:14:28,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {14846#true} assume true; {14846#true} is VALID [2022-04-27 11:14:28,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14846#true} {14846#true} #83#return; {14846#true} is VALID [2022-04-27 11:14:28,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {14846#true} call #t~ret15 := main(); {14846#true} is VALID [2022-04-27 11:14:28,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {14846#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14852#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-27 11:14:28,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {14852#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14853#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-27 11:14:28,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {14853#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14856#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:14:28,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {14856#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= 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; {14857#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:14:28,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {14857#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-27 11:14:28,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-27 11:14:28,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-27 11:14:28,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-27 11:14:28,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-27 11:14:28,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-27 11:14:28,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {14858#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14857#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:14:28,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {14857#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14856#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:14:28,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {14856#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {14855#(and (<= (+ main_~x~0 3) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14856#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:14:28,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {14856#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14857#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:14:28,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {14857#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,150 INFO L272 TraceCheckUtils]: 27: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14860#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:14:28,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {14860#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {14861#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:14:28,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {14861#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14847#false} is VALID [2022-04-27 11:14:28,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {14847#false} assume !false; {14847#false} is VALID [2022-04-27 11:14:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:14:28,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:28,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694334169] [2022-04-27 11:14:28,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694334169] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:28,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693847330] [2022-04-27 11:14:28,152 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:14:28,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:28,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:28,155 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:14:28,157 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:14:28,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:14:28,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:28,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 11:14:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:28,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:28,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {14846#true} call ULTIMATE.init(); {14846#true} is VALID [2022-04-27 11:14:28,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {14846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14846#true} is VALID [2022-04-27 11:14:28,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {14846#true} assume true; {14846#true} is VALID [2022-04-27 11:14:28,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14846#true} {14846#true} #83#return; {14846#true} is VALID [2022-04-27 11:14:28,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {14846#true} call #t~ret15 := main(); {14846#true} is VALID [2022-04-27 11:14:28,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {14846#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:14:28,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:14:28,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:14:28,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:14:28,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) 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; {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) 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; {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) 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; {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:14:28,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:14:28,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:14:28,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {14854#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-27 11:14:28,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {14888#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-27 11:14:28,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {14884#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:14:28,501 INFO L272 TraceCheckUtils]: 27: Hoare triple {14851#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14949#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:28,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {14949#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14953#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:28,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {14953#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14847#false} is VALID [2022-04-27 11:14:28,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {14847#false} assume !false; {14847#false} is VALID [2022-04-27 11:14:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:14:28,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:28,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {14847#false} assume !false; {14847#false} is VALID [2022-04-27 11:14:28,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {14953#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14847#false} is VALID [2022-04-27 11:14:28,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {14949#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14953#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:14:28,886 INFO L272 TraceCheckUtils]: 27: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14949#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:14:28,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:14:28,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:14:28,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (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; {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 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; {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} ~z~0 := ~y~0; {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:14:28,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:14:28,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (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; {14983#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:14:28,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {14979#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14975#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:14:28,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {14846#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14859#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:14:28,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {14846#true} call #t~ret15 := main(); {14846#true} is VALID [2022-04-27 11:14:28,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14846#true} {14846#true} #83#return; {14846#true} is VALID [2022-04-27 11:14:28,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {14846#true} assume true; {14846#true} is VALID [2022-04-27 11:14:28,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {14846#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14846#true} is VALID [2022-04-27 11:14:28,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {14846#true} call ULTIMATE.init(); {14846#true} is VALID [2022-04-27 11:14:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:14:28,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693847330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:28,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:28,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2022-04-27 11:14:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961102588] [2022-04-27 11:14:28,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 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 31 [2022-04-27 11:14:28,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:28,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 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:14:30,019 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:14:30,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 11:14:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:30,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 11:14:30,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:14:30,020 INFO L87 Difference]: Start difference. First operand 207 states and 281 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 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:14:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:31,507 INFO L93 Difference]: Finished difference Result 217 states and 291 transitions. [2022-04-27 11:14:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:14:31,507 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 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 31 [2022-04-27 11:14:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 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:14:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-27 11:14:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 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:14:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-27 11:14:31,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2022-04-27 11:14:31,559 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:14:31,561 INFO L225 Difference]: With dead ends: 217 [2022-04-27 11:14:31,561 INFO L226 Difference]: Without dead ends: 208 [2022-04-27 11:14:31,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:14:31,562 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:31,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:14:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-27 11:14:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-04-27 11:14:32,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:32,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 208 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 203 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:32,033 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 208 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 203 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:32,033 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 208 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 203 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:32,036 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2022-04-27 11:14:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 282 transitions. [2022-04-27 11:14:32,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:32,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:32,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 203 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 208 states. [2022-04-27 11:14:32,037 INFO L87 Difference]: Start difference. First operand has 208 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 203 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 208 states. [2022-04-27 11:14:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:32,040 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2022-04-27 11:14:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 282 transitions. [2022-04-27 11:14:32,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:32,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:32,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:32,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 203 states have internal predecessors, (278), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:14:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 282 transitions. [2022-04-27 11:14:32,044 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 282 transitions. Word has length 31 [2022-04-27 11:14:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:32,044 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 282 transitions. [2022-04-27 11:14:32,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 18 states have internal predecessors, (66), 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:14:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 282 transitions. [2022-04-27 11:14:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:14:32,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:32,045 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:32,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 11:14:32,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:32,267 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:32,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash -604600770, now seen corresponding path program 4 times [2022-04-27 11:14:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:32,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340706927] [2022-04-27 11:14:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:32,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {16120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16104#true} is VALID [2022-04-27 11:14:32,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {16104#true} assume true; {16104#true} is VALID [2022-04-27 11:14:32,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16104#true} {16104#true} #83#return; {16104#true} is VALID [2022-04-27 11:14:32,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {16104#true} call ULTIMATE.init(); {16120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:32,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {16120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16104#true} is VALID [2022-04-27 11:14:32,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {16104#true} assume true; {16104#true} is VALID [2022-04-27 11:14:32,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16104#true} {16104#true} #83#return; {16104#true} is VALID [2022-04-27 11:14:32,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {16104#true} call #t~ret15 := main(); {16104#true} is VALID [2022-04-27 11:14:32,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {16104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16109#(= main_~y~0 0)} is VALID [2022-04-27 11:14:32,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {16109#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:32,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {16110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:32,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {16111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:32,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {16112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:32,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {16113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:32,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {16114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {16114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:32,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {16114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {16115#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:32,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {16115#(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; {16116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:32,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {16116#(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; {16117#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:32,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {16117#(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; {16118#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {16118#(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; {16119#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {16119#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {16105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {16105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {16105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {16105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {16105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {16105#false} assume !(~y~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {16105#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#false} assume !(~x~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {16105#false} assume !(~z~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,452 INFO L272 TraceCheckUtils]: 27: Hoare triple {16105#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16105#false} is VALID [2022-04-27 11:14:32,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {16105#false} ~cond := #in~cond; {16105#false} is VALID [2022-04-27 11:14:32,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {16105#false} assume 0 == ~cond; {16105#false} is VALID [2022-04-27 11:14:32,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {16105#false} assume !false; {16105#false} is VALID [2022-04-27 11:14:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:14:32,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:32,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340706927] [2022-04-27 11:14:32,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340706927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:32,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390579052] [2022-04-27 11:14:32,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:14:32,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:32,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:32,453 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:14:32,454 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:14:32,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:14:32,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:32,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:14:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:32,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:32,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {16104#true} call ULTIMATE.init(); {16104#true} is VALID [2022-04-27 11:14:32,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {16104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16104#true} is VALID [2022-04-27 11:14:32,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {16104#true} assume true; {16104#true} is VALID [2022-04-27 11:14:32,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16104#true} {16104#true} #83#return; {16104#true} is VALID [2022-04-27 11:14:32,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {16104#true} call #t~ret15 := main(); {16104#true} is VALID [2022-04-27 11:14:32,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {16104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16104#true} is VALID [2022-04-27 11:14:32,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {16104#true} assume !!(~x~0 % 4294967296 > 0);#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#true} is VALID [2022-04-27 11:14:32,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {16104#true} assume !!(~x~0 % 4294967296 > 0);#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#true} is VALID [2022-04-27 11:14:32,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {16104#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:32,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:32,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:32,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:32,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:32,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:32,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:32,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16172#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:32,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {16172#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16172#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:32,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {16172#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {16105#false} assume !(~z~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,685 INFO L272 TraceCheckUtils]: 27: Hoare triple {16105#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16105#false} is VALID [2022-04-27 11:14:32,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {16105#false} ~cond := #in~cond; {16105#false} is VALID [2022-04-27 11:14:32,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {16105#false} assume 0 == ~cond; {16105#false} is VALID [2022-04-27 11:14:32,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {16105#false} assume !false; {16105#false} is VALID [2022-04-27 11:14:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:14:32,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:32,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {16105#false} assume !false; {16105#false} is VALID [2022-04-27 11:14:32,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {16105#false} assume 0 == ~cond; {16105#false} is VALID [2022-04-27 11:14:32,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {16105#false} ~cond := #in~cond; {16105#false} is VALID [2022-04-27 11:14:32,801 INFO L272 TraceCheckUtils]: 27: Hoare triple {16105#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16105#false} is VALID [2022-04-27 11:14:32,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {16105#false} assume !(~z~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {16172#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16105#false} is VALID [2022-04-27 11:14:32,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16172#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:32,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {16176#(< 0 (mod (+ main_~x~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; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {16172#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16176#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:14:32,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16172#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:32,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:32,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:32,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} ~z~0 := ~y~0; {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:32,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:32,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16156#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:32,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16152#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:32,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {16104#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16148#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:32,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {16104#true} assume !!(~x~0 % 4294967296 > 0);#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#true} is VALID [2022-04-27 11:14:32,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {16104#true} assume !!(~x~0 % 4294967296 > 0);#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#true} is VALID [2022-04-27 11:14:32,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {16104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16104#true} is VALID [2022-04-27 11:14:32,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {16104#true} call #t~ret15 := main(); {16104#true} is VALID [2022-04-27 11:14:32,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16104#true} {16104#true} #83#return; {16104#true} is VALID [2022-04-27 11:14:32,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {16104#true} assume true; {16104#true} is VALID [2022-04-27 11:14:32,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {16104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16104#true} is VALID [2022-04-27 11:14:32,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {16104#true} call ULTIMATE.init(); {16104#true} is VALID [2022-04-27 11:14:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:14:32,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390579052] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:32,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:32,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-27 11:14:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794076788] [2022-04-27 11:14:32,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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:14:32,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:32,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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:14:32,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:14:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:14:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:14:32,847 INFO L87 Difference]: Start difference. First operand 208 states and 282 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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:14:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:40,690 INFO L93 Difference]: Finished difference Result 376 states and 513 transitions. [2022-04-27 11:14:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-27 11:14:40,690 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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:14:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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:14:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 247 transitions. [2022-04-27 11:14:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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:14:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 247 transitions. [2022-04-27 11:14:40,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 247 transitions. [2022-04-27 11:14:41,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:41,022 INFO L225 Difference]: With dead ends: 376 [2022-04-27 11:14:41,022 INFO L226 Difference]: Without dead ends: 357 [2022-04-27 11:14:41,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1959 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=743, Invalid=5899, Unknown=0, NotChecked=0, Total=6642 [2022-04-27 11:14:41,024 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 203 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:41,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 144 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 11:14:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-27 11:14:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 194. [2022-04-27 11:14:41,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:14:41,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states 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:14:41,521 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states 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:14:41,521 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states 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:14:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:41,529 INFO L93 Difference]: Finished difference Result 357 states and 489 transitions. [2022-04-27 11:14:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 489 transitions. [2022-04-27 11:14:41,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:41,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:41,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-27 11:14:41,530 INFO L87 Difference]: Start difference. First operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 357 states. [2022-04-27 11:14:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:41,538 INFO L93 Difference]: Finished difference Result 357 states and 489 transitions. [2022-04-27 11:14:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 489 transitions. [2022-04-27 11:14:41,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:14:41,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:14:41,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:14:41,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:14:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.380952380952381) internal successors, (261), 189 states have internal predecessors, (261), 3 states have call successors, (3), 3 states 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:14:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 265 transitions. [2022-04-27 11:14:41,542 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 265 transitions. Word has length 31 [2022-04-27 11:14:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:14:41,542 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 265 transitions. [2022-04-27 11:14:41,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 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:14:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 265 transitions. [2022-04-27 11:14:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:14:41,543 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:14:41,543 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:14:41,565 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:14:41,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:41,759 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:14:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:14:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1558438816, now seen corresponding path program 5 times [2022-04-27 11:14:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:14:41,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561987691] [2022-04-27 11:14:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:14:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:14:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:14:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:41,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {17977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17959#true} is VALID [2022-04-27 11:14:41,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {17959#true} assume true; {17959#true} is VALID [2022-04-27 11:14:41,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17959#true} {17959#true} #83#return; {17959#true} is VALID [2022-04-27 11:14:41,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {17959#true} call ULTIMATE.init(); {17977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:14:41,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {17977#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17959#true} is VALID [2022-04-27 11:14:41,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {17959#true} assume true; {17959#true} is VALID [2022-04-27 11:14:41,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17959#true} {17959#true} #83#return; {17959#true} is VALID [2022-04-27 11:14:41,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {17959#true} call #t~ret15 := main(); {17959#true} is VALID [2022-04-27 11:14:41,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {17959#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17964#(= main_~y~0 0)} is VALID [2022-04-27 11:14:41,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {17964#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17965#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:14:41,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {17965#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17966#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:14:41,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {17966#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17967#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:14:41,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {17967#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17968#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:14:41,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {17968#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17969#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:41,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {17969#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {17969#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:14:41,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {17969#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {17970#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:14:41,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {17970#(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; {17971#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:41,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {17971#(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; {17972#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:41,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {17972#(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; {17973#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:41,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {17973#(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; {17974#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:41,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {17974#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17975#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:14:41,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {17975#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17975#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:14:41,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {17975#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17974#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:14:41,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {17974#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17973#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:14:41,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {17973#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17972#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:14:41,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {17972#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17971#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:14:41,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {17971#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17976#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:41,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {17976#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {17976#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:41,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {17976#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {17976#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:14:41,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {17976#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17960#false} is VALID [2022-04-27 11:14:41,997 INFO L272 TraceCheckUtils]: 27: Hoare triple {17960#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17960#false} is VALID [2022-04-27 11:14:41,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {17960#false} ~cond := #in~cond; {17960#false} is VALID [2022-04-27 11:14:41,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {17960#false} assume 0 == ~cond; {17960#false} is VALID [2022-04-27 11:14:41,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {17960#false} assume !false; {17960#false} is VALID [2022-04-27 11:14:41,998 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:14:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:14:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561987691] [2022-04-27 11:14:41,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561987691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:14:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070354740] [2022-04-27 11:14:41,998 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:14:41,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:14:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:14:41,999 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:14:42,000 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:14:42,061 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:14:42,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:14:42,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:14:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:14:42,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:14:42,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {17959#true} call ULTIMATE.init(); {17959#true} is VALID [2022-04-27 11:14:42,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {17959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17959#true} is VALID [2022-04-27 11:14:42,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {17959#true} assume true; {17959#true} is VALID [2022-04-27 11:14:42,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17959#true} {17959#true} #83#return; {17959#true} is VALID [2022-04-27 11:14:42,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {17959#true} call #t~ret15 := main(); {17959#true} is VALID [2022-04-27 11:14:42,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {17959#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17959#true} is VALID [2022-04-27 11:14:42,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {17959#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:42,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:42,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:42,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:42,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:42,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:42,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:42,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:42,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:42,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:42,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:42,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17960#false} is VALID [2022-04-27 11:14:42,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {17960#false} assume !(~z~0 % 4294967296 > 0); {17960#false} is VALID [2022-04-27 11:14:42,280 INFO L272 TraceCheckUtils]: 27: Hoare triple {17960#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17960#false} is VALID [2022-04-27 11:14:42,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {17960#false} ~cond := #in~cond; {17960#false} is VALID [2022-04-27 11:14:42,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {17960#false} assume 0 == ~cond; {17960#false} is VALID [2022-04-27 11:14:42,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {17960#false} assume !false; {17960#false} is VALID [2022-04-27 11:14:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:42,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:14:42,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {17960#false} assume !false; {17960#false} is VALID [2022-04-27 11:14:42,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {17960#false} assume 0 == ~cond; {17960#false} is VALID [2022-04-27 11:14:42,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {17960#false} ~cond := #in~cond; {17960#false} is VALID [2022-04-27 11:14:42,394 INFO L272 TraceCheckUtils]: 27: Hoare triple {17960#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17960#false} is VALID [2022-04-27 11:14:42,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {17960#false} assume !(~z~0 % 4294967296 > 0); {17960#false} is VALID [2022-04-27 11:14:42,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17960#false} is VALID [2022-04-27 11:14:42,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {18037#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18037#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:14:42,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:42,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:42,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:42,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:42,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:42,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:42,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18015#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-27 11:14:42,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18011#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-27 11:14:42,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18007#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-27 11:14:42,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18003#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:14:42,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {17959#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17999#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:14:42,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {17959#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17959#true} is VALID [2022-04-27 11:14:42,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {17959#true} call #t~ret15 := main(); {17959#true} is VALID [2022-04-27 11:14:42,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17959#true} {17959#true} #83#return; {17959#true} is VALID [2022-04-27 11:14:42,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {17959#true} assume true; {17959#true} is VALID [2022-04-27 11:14:42,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {17959#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17959#true} is VALID [2022-04-27 11:14:42,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {17959#true} call ULTIMATE.init(); {17959#true} is VALID [2022-04-27 11:14:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:14:42,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070354740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:14:42,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:14:42,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-27 11:14:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587857374] [2022-04-27 11:14:42,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:14:42,410 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:14:42,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:14:42,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:14:42,446 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:14:42,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:14:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:14:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:14:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:14:42,447 INFO L87 Difference]: Start difference. First operand 194 states and 265 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:14:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:14:58,920 INFO L93 Difference]: Finished difference Result 380 states and 532 transitions. [2022-04-27 11:14:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-04-27 11:14:58,921 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:14:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:14:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:14:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 293 transitions. [2022-04-27 11:14:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:14:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 293 transitions. [2022-04-27 11:14:58,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 293 transitions. [2022-04-27 11:14:59,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:14:59,513 INFO L225 Difference]: With dead ends: 380 [2022-04-27 11:14:59,513 INFO L226 Difference]: Without dead ends: 365 [2022-04-27 11:14:59,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6314 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1697, Invalid=16393, Unknown=0, NotChecked=0, Total=18090 [2022-04-27 11:14:59,517 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 267 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:14:59,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 119 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-27 11:14:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-27 11:15:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 226. [2022-04-27 11:15:00,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:15:00,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 226 states, 221 states have (on average 1.3710407239819005) internal successors, (303), 221 states have internal predecessors, (303), 3 states have call successors, (3), 3 states 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:15:00,068 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 226 states, 221 states have (on average 1.3710407239819005) internal successors, (303), 221 states have internal predecessors, (303), 3 states have call successors, (3), 3 states 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:15:00,068 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 226 states, 221 states have (on average 1.3710407239819005) internal successors, (303), 221 states have internal predecessors, (303), 3 states have call successors, (3), 3 states 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:15:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:00,072 INFO L93 Difference]: Finished difference Result 365 states and 475 transitions. [2022-04-27 11:15:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 475 transitions. [2022-04-27 11:15:00,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:00,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:00,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 221 states have (on average 1.3710407239819005) internal successors, (303), 221 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-27 11:15:00,074 INFO L87 Difference]: Start difference. First operand has 226 states, 221 states have (on average 1.3710407239819005) internal successors, (303), 221 states have internal predecessors, (303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-27 11:15:00,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:15:00,080 INFO L93 Difference]: Finished difference Result 365 states and 475 transitions. [2022-04-27 11:15:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 475 transitions. [2022-04-27 11:15:00,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:15:00,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:15:00,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:15:00,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:15:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.3710407239819005) internal successors, (303), 221 states have internal predecessors, (303), 3 states have call successors, (3), 3 states 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:15:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 307 transitions. [2022-04-27 11:15:00,085 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 307 transitions. Word has length 31 [2022-04-27 11:15:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:15:00,085 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 307 transitions. [2022-04-27 11:15:00,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:15:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 307 transitions. [2022-04-27 11:15:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 11:15:00,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:15:00,086 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:15:00,108 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:15:00,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:00,301 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:15:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:15:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash 112563583, now seen corresponding path program 5 times [2022-04-27 11:15:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:15:00,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81086514] [2022-04-27 11:15:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:15:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:15:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:00,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:15:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:00,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {19978#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19958#true} is VALID [2022-04-27 11:15:00,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {19958#true} assume true; {19958#true} is VALID [2022-04-27 11:15:00,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19958#true} {19958#true} #83#return; {19958#true} is VALID [2022-04-27 11:15:00,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {19958#true} call ULTIMATE.init(); {19978#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:15:00,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {19978#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19958#true} is VALID [2022-04-27 11:15:00,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {19958#true} assume true; {19958#true} is VALID [2022-04-27 11:15:00,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19958#true} {19958#true} #83#return; {19958#true} is VALID [2022-04-27 11:15:00,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {19958#true} call #t~ret15 := main(); {19958#true} is VALID [2022-04-27 11:15:00,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {19958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19963#(= main_~y~0 0)} is VALID [2022-04-27 11:15:00,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {19963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:00,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {19964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:00,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {19965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:00,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {19966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:00,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {19967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:00,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {19968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19969#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:00,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {19969#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:15:00,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {19970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19971#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:15:00,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {19971#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19972#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:15:00,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {19972#(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; {19973#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:15:00,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {19973#(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; {19974#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:15:00,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {19974#(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; {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:00,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:00,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {19976#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:15:00,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {19976#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19977#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-27 11:15:00,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {19977#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:00,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {19959#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19959#false} is VALID [2022-04-27 11:15:00,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {19959#false} assume !(~y~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:00,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {19959#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19959#false} is VALID [2022-04-27 11:15:00,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {19959#false} assume !(~x~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:00,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {19959#false} assume !(~z~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:00,579 INFO L272 TraceCheckUtils]: 27: Hoare triple {19959#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19959#false} is VALID [2022-04-27 11:15:00,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {19959#false} ~cond := #in~cond; {19959#false} is VALID [2022-04-27 11:15:00,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {19959#false} assume 0 == ~cond; {19959#false} is VALID [2022-04-27 11:15:00,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {19959#false} assume !false; {19959#false} is VALID [2022-04-27 11:15:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:15:00,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81086514] [2022-04-27 11:15:00,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81086514] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:15:00,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425779562] [2022-04-27 11:15:00,580 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:15:00,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:15:00,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:15:00,584 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:15:00,588 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:15:00,874 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-04-27 11:15:00,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:15:00,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 11:15:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:15:00,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:15:01,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {19958#true} call ULTIMATE.init(); {19958#true} is VALID [2022-04-27 11:15:01,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {19958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19958#true} is VALID [2022-04-27 11:15:01,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {19958#true} assume true; {19958#true} is VALID [2022-04-27 11:15:01,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19958#true} {19958#true} #83#return; {19958#true} is VALID [2022-04-27 11:15:01,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {19958#true} call #t~ret15 := main(); {19958#true} is VALID [2022-04-27 11:15:01,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {19958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19963#(= main_~y~0 0)} is VALID [2022-04-27 11:15:01,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {19963#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:15:01,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {19964#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:15:01,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {19965#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:15:01,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {19966#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:15:01,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {19967#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:15:01,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {19968#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19969#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:15:01,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {19969#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:15:01,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {19970#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19971#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:15:01,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {19971#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19972#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:15:01,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {19972#(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; {19973#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:15:01,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {19973#(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; {19974#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:15:01,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {19974#(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; {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:01,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:15:01,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {19975#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {19976#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:15:01,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {19976#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20042#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:15:01,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {20042#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {19959#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {19959#false} assume !(~y~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {19959#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {19959#false} assume !(~x~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {19959#false} assume !(~z~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L272 TraceCheckUtils]: 27: Hoare triple {19959#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {19959#false} ~cond := #in~cond; {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {19959#false} assume 0 == ~cond; {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {19959#false} assume !false; {19959#false} is VALID [2022-04-27 11:15:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:01,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:15:01,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {19959#false} assume !false; {19959#false} is VALID [2022-04-27 11:15:01,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {19959#false} assume 0 == ~cond; {19959#false} is VALID [2022-04-27 11:15:01,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {19959#false} ~cond := #in~cond; {19959#false} is VALID [2022-04-27 11:15:01,541 INFO L272 TraceCheckUtils]: 27: Hoare triple {19959#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19959#false} is VALID [2022-04-27 11:15:01,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {19959#false} assume !(~z~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {19959#false} assume !(~x~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {19959#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19959#false} is VALID [2022-04-27 11:15:01,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {19959#false} assume !(~y~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {19959#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19959#false} is VALID [2022-04-27 11:15:01,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {20100#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19959#false} is VALID [2022-04-27 11:15:01,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {20104#(< 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; {20100#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:15:01,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {20108#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {20104#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:01,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {20108#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20108#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:01,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {20115#(< 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; {20108#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:15:01,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {20119#(< 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; {20115#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:15:01,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {20123#(< 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; {20119#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:15:01,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {20127#(< 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; {20123#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:15:01,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {20131#(< 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; {20127#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:15:01,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {20135#(< 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; {20131#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:15:01,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {20139#(< 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; {20135#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:15:01,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {20143#(< 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; {20139#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:15:01,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {20147#(< 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; {20143#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:15:01,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {20151#(< 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; {20147#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:15:01,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {20155#(< 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; {20151#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:15:01,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {20159#(< 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; {20155#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:15:01,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {19958#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20159#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:15:01,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {19958#true} call #t~ret15 := main(); {19958#true} is VALID [2022-04-27 11:15:01,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19958#true} {19958#true} #83#return; {19958#true} is VALID [2022-04-27 11:15:01,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {19958#true} assume true; {19958#true} is VALID [2022-04-27 11:15:01,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {19958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19958#true} is VALID [2022-04-27 11:15:01,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {19958#true} call ULTIMATE.init(); {19958#true} is VALID [2022-04-27 11:15:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:15:01,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425779562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:15:01,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:15:01,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-27 11:15:01,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049069660] [2022-04-27 11:15:01,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:15:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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:15:01,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:15:01,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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:15:01,584 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:15:01,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-27 11:15:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:15:01,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-27 11:15:01,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:15:01,585 INFO L87 Difference]: Start difference. First operand 226 states and 307 transitions. Second operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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:15:31,914 WARN L232 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:17:04,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:17:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:08,082 INFO L93 Difference]: Finished difference Result 920 states and 1372 transitions. [2022-04-27 11:17:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-04-27 11:17:08,083 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 492 transitions. [2022-04-27 11:17:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 492 transitions. [2022-04-27 11:17:08,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 492 transitions. [2022-04-27 11:17:11,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:11,853 INFO L225 Difference]: With dead ends: 920 [2022-04-27 11:17:11,853 INFO L226 Difference]: Without dead ends: 879 [2022-04-27 11:17:11,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9847 ImplicationChecksByTransitivity, 105.3s TimeCoverageRelationStatistics Valid=6087, Invalid=19353, Unknown=0, NotChecked=0, Total=25440 [2022-04-27 11:17:11,855 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 1411 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 1251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 3425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1251 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:11,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 166 Invalid, 3425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1251 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-04-27 11:17:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2022-04-27 11:17:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 257. [2022-04-27 11:17:12,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:12,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 879 states. Second operand has 257 states, 252 states have (on average 1.380952380952381) internal successors, (348), 252 states have internal predecessors, (348), 3 states have call successors, (3), 3 states 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:12,517 INFO L74 IsIncluded]: Start isIncluded. First operand 879 states. Second operand has 257 states, 252 states have (on average 1.380952380952381) internal successors, (348), 252 states have internal predecessors, (348), 3 states have call successors, (3), 3 states 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:12,517 INFO L87 Difference]: Start difference. First operand 879 states. Second operand has 257 states, 252 states have (on average 1.380952380952381) internal successors, (348), 252 states have internal predecessors, (348), 3 states have call successors, (3), 3 states 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:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:12,539 INFO L93 Difference]: Finished difference Result 879 states and 1219 transitions. [2022-04-27 11:17:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1219 transitions. [2022-04-27 11:17:12,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:12,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:12,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.380952380952381) internal successors, (348), 252 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 879 states. [2022-04-27 11:17:12,541 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.380952380952381) internal successors, (348), 252 states have internal predecessors, (348), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 879 states. [2022-04-27 11:17:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:12,564 INFO L93 Difference]: Finished difference Result 879 states and 1219 transitions. [2022-04-27 11:17:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1219 transitions. [2022-04-27 11:17:12,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:12,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:12,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:12,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.380952380952381) internal successors, (348), 252 states have internal predecessors, (348), 3 states have call successors, (3), 3 states 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:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 352 transitions. [2022-04-27 11:17:12,570 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 352 transitions. Word has length 31 [2022-04-27 11:17:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:12,570 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 352 transitions. [2022-04-27 11:17:12,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 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:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 352 transitions. [2022-04-27 11:17:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:17:12,570 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:12,570 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:12,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-27 11:17:12,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:12,775 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1990656643, now seen corresponding path program 6 times [2022-04-27 11:17:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258760057] [2022-04-27 11:17:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:12,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:12,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {23719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23710#true} is VALID [2022-04-27 11:17:12,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {23710#true} assume true; {23710#true} is VALID [2022-04-27 11:17:12,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23710#true} {23710#true} #83#return; {23710#true} is VALID [2022-04-27 11:17:12,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {23710#true} call ULTIMATE.init(); {23719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:12,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {23719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23710#true} is VALID [2022-04-27 11:17:12,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {23710#true} assume true; {23710#true} is VALID [2022-04-27 11:17:12,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23710#true} {23710#true} #83#return; {23710#true} is VALID [2022-04-27 11:17:12,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {23710#true} call #t~ret15 := main(); {23710#true} is VALID [2022-04-27 11:17:12,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {23710#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23710#true} is VALID [2022-04-27 11:17:12,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:12,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:12,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:12,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {23710#true} assume !(~x~0 % 4294967296 > 0); {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:12,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:12,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:12,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:12,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:12,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:12,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23711#false} is VALID [2022-04-27 11:17:12,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {23711#false} assume !(~x~0 % 4294967296 > 0); {23711#false} is VALID [2022-04-27 11:17:12,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:12,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:12,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:12,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {23711#false} assume !(~z~0 % 4294967296 > 0); {23711#false} is VALID [2022-04-27 11:17:12,917 INFO L272 TraceCheckUtils]: 28: Hoare triple {23711#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23711#false} is VALID [2022-04-27 11:17:12,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {23711#false} ~cond := #in~cond; {23711#false} is VALID [2022-04-27 11:17:12,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {23711#false} assume 0 == ~cond; {23711#false} is VALID [2022-04-27 11:17:12,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {23711#false} assume !false; {23711#false} is VALID [2022-04-27 11:17:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:17:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258760057] [2022-04-27 11:17:12,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258760057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:12,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585226371] [2022-04-27 11:17:12,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:17:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:12,920 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:12,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 11:17:12,982 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:17:12,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:12,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:17:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:12,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:13,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {23710#true} call ULTIMATE.init(); {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {23710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {23710#true} assume true; {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23710#true} {23710#true} #83#return; {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {23710#true} call #t~ret15 := main(); {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {23710#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:13,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {23710#true} assume !(~x~0 % 4294967296 > 0); {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:13,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:13,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:13,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:13,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {23711#false} assume !(~x~0 % 4294967296 > 0); {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {23711#false} assume !(~z~0 % 4294967296 > 0); {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L272 TraceCheckUtils]: 28: Hoare triple {23711#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {23711#false} ~cond := #in~cond; {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {23711#false} assume 0 == ~cond; {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {23711#false} assume !false; {23711#false} is VALID [2022-04-27 11:17:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:17:13,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:13,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {23711#false} assume !false; {23711#false} is VALID [2022-04-27 11:17:13,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {23711#false} assume 0 == ~cond; {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {23711#false} ~cond := #in~cond; {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L272 TraceCheckUtils]: 28: Hoare triple {23711#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {23711#false} assume !(~z~0 % 4294967296 > 0); {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {23711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {23711#false} assume !(~x~0 % 4294967296 > 0); {23711#false} is VALID [2022-04-27 11:17:13,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23711#false} is VALID [2022-04-27 11:17:13,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:13,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:13,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:17:13,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:17:13,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:13,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {23710#true} assume !(~x~0 % 4294967296 > 0); {23715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:17:13,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:13,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:13,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {23710#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23710#true} is VALID [2022-04-27 11:17:13,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {23710#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23710#true} is VALID [2022-04-27 11:17:13,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {23710#true} call #t~ret15 := main(); {23710#true} is VALID [2022-04-27 11:17:13,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23710#true} {23710#true} #83#return; {23710#true} is VALID [2022-04-27 11:17:13,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {23710#true} assume true; {23710#true} is VALID [2022-04-27 11:17:13,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {23710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {23710#true} is VALID [2022-04-27 11:17:13,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {23710#true} call ULTIMATE.init(); {23710#true} is VALID [2022-04-27 11:17:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:17:13,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585226371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:13,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:13,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-27 11:17:13,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230211728] [2022-04-27 11:17:13,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 32 [2022-04-27 11:17:13,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:13,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:13,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:13,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:17:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:13,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:17:13,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:17:13,476 INFO L87 Difference]: Start difference. First operand 257 states and 352 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:14,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:14,614 INFO L93 Difference]: Finished difference Result 305 states and 411 transitions. [2022-04-27 11:17:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:17:14,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 32 [2022-04-27 11:17:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-27 11:17:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-27 11:17:14,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-27 11:17:14,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:14,670 INFO L225 Difference]: With dead ends: 305 [2022-04-27 11:17:14,670 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 11:17:14,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:17:14,671 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:14,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:17:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 11:17:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-27 11:17:15,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:15,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.375) internal successors, (352), 256 states have internal predecessors, (352), 3 states have call successors, (3), 3 states 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:15,331 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.375) internal successors, (352), 256 states have internal predecessors, (352), 3 states have call successors, (3), 3 states 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:15,331 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.375) internal successors, (352), 256 states have internal predecessors, (352), 3 states have call successors, (3), 3 states 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:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:15,334 INFO L93 Difference]: Finished difference Result 278 states and 377 transitions. [2022-04-27 11:17:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 377 transitions. [2022-04-27 11:17:15,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:15,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:15,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.375) internal successors, (352), 256 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-27 11:17:15,335 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.375) internal successors, (352), 256 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-27 11:17:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:15,338 INFO L93 Difference]: Finished difference Result 278 states and 377 transitions. [2022-04-27 11:17:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 377 transitions. [2022-04-27 11:17:15,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:15,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:15,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:15,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.375) internal successors, (352), 256 states have internal predecessors, (352), 3 states have call successors, (3), 3 states 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:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 356 transitions. [2022-04-27 11:17:15,341 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 356 transitions. Word has length 32 [2022-04-27 11:17:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:15,341 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 356 transitions. [2022-04-27 11:17:15,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 356 transitions. [2022-04-27 11:17:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:17:15,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:15,342 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:15,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 11:17:15,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:15,542 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 904933634, now seen corresponding path program 6 times [2022-04-27 11:17:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:15,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283230173] [2022-04-27 11:17:15,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:15,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25279#true} is VALID [2022-04-27 11:17:15,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {25279#true} assume true; {25279#true} is VALID [2022-04-27 11:17:15,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25279#true} {25279#true} #83#return; {25279#true} is VALID [2022-04-27 11:17:15,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {25279#true} call ULTIMATE.init(); {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:15,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {25294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25279#true} is VALID [2022-04-27 11:17:15,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {25279#true} assume true; {25279#true} is VALID [2022-04-27 11:17:15,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25279#true} {25279#true} #83#return; {25279#true} is VALID [2022-04-27 11:17:15,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {25279#true} call #t~ret15 := main(); {25279#true} is VALID [2022-04-27 11:17:15,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {25279#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25284#(= main_~y~0 0)} is VALID [2022-04-27 11:17:15,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {25284#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25285#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:15,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {25285#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25286#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:15,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {25286#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25287#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:15,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {25287#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25288#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:15,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {25288#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25289#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:15,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {25289#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:15,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:15,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {25291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:15,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {25291#(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; {25292#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:15,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {25292#(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; {25293#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {25293#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {25280#false} assume !(~y~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {25280#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25280#false} is VALID [2022-04-27 11:17:15,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {25280#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25280#false} is VALID [2022-04-27 11:17:15,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {25280#false} assume !(~x~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:15,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {25280#false} assume !(~z~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:15,713 INFO L272 TraceCheckUtils]: 28: Hoare triple {25280#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25280#false} is VALID [2022-04-27 11:17:15,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {25280#false} ~cond := #in~cond; {25280#false} is VALID [2022-04-27 11:17:15,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {25280#false} assume 0 == ~cond; {25280#false} is VALID [2022-04-27 11:17:15,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {25280#false} assume !false; {25280#false} is VALID [2022-04-27 11:17:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:17:15,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283230173] [2022-04-27 11:17:15,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283230173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849507956] [2022-04-27 11:17:15,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:17:15,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:15,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:15,715 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:15,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 11:17:15,857 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:17:15,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:15,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 11:17:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:15,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:16,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {25279#true} call ULTIMATE.init(); {25279#true} is VALID [2022-04-27 11:17:16,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {25279#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25279#true} is VALID [2022-04-27 11:17:16,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {25279#true} assume true; {25279#true} is VALID [2022-04-27 11:17:16,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25279#true} {25279#true} #83#return; {25279#true} is VALID [2022-04-27 11:17:16,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {25279#true} call #t~ret15 := main(); {25279#true} is VALID [2022-04-27 11:17:16,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {25279#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25284#(= main_~y~0 0)} is VALID [2022-04-27 11:17:16,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {25284#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25285#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:16,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {25285#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25286#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:16,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {25286#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25287#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:16,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {25287#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25288#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:16,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {25288#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25289#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:16,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {25289#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:16,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:16,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {25290#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {25291#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:16,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {25291#(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; {25292#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:16,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {25292#(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; {25343#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:16,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {25343#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {25280#false} assume !(~y~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {25280#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {25280#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {25280#false} assume !(~x~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {25280#false} assume !(~z~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L272 TraceCheckUtils]: 28: Hoare triple {25280#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {25280#false} ~cond := #in~cond; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {25280#false} assume 0 == ~cond; {25280#false} is VALID [2022-04-27 11:17:16,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {25280#false} assume !false; {25280#false} is VALID [2022-04-27 11:17:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:17:16,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {25280#false} assume !false; {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {25280#false} assume 0 == ~cond; {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {25280#false} ~cond := #in~cond; {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L272 TraceCheckUtils]: 28: Hoare triple {25280#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {25280#false} assume !(~z~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {25280#false} assume !(~x~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {25280#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {25280#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {25280#false} assume !(~y~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {25280#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25280#false} is VALID [2022-04-27 11:17:16,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {25437#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25280#false} is VALID [2022-04-27 11:17:16,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {25441#(< 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; {25437#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:17:16,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {25445#(< 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; {25441#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:16,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {25449#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {25445#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:16,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {25449#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25449#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:16,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {25456#(< 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; {25449#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:16,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {25460#(< 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; {25456#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:16,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {25464#(< 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; {25460#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:17:16,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {25468#(< 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; {25464#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:17:16,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {25472#(< 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; {25468#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:17:16,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {25476#(< 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; {25472#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:17:16,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {25279#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25476#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:17:16,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {25279#true} call #t~ret15 := main(); {25279#true} is VALID [2022-04-27 11:17:16,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25279#true} {25279#true} #83#return; {25279#true} is VALID [2022-04-27 11:17:16,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {25279#true} assume true; {25279#true} is VALID [2022-04-27 11:17:16,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {25279#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25279#true} is VALID [2022-04-27 11:17:16,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {25279#true} call ULTIMATE.init(); {25279#true} is VALID [2022-04-27 11:17:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:17:16,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849507956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:16,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:16,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-27 11:17:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248512926] [2022-04-27 11:17:16,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:16,389 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 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 32 [2022-04-27 11:17:16,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:16,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 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:16,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:16,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 11:17:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:16,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 11:17:16,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:17:16,418 INFO L87 Difference]: Start difference. First operand 261 states and 356 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 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:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:30,113 INFO L93 Difference]: Finished difference Result 627 states and 849 transitions. [2022-04-27 11:17:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-04-27 11:17:30,113 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 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 32 [2022-04-27 11:17:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 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:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 336 transitions. [2022-04-27 11:17:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 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:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 336 transitions. [2022-04-27 11:17:30,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 336 transitions. [2022-04-27 11:17:30,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:30,995 INFO L225 Difference]: With dead ends: 627 [2022-04-27 11:17:30,995 INFO L226 Difference]: Without dead ends: 579 [2022-04-27 11:17:30,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5763 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3248, Invalid=12502, Unknown=0, NotChecked=0, Total=15750 [2022-04-27 11:17:30,997 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 481 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:30,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 111 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 11:17:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-04-27 11:17:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 278. [2022-04-27 11:17:31,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:31,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 579 states. Second operand has 278 states, 273 states have (on average 1.36996336996337) internal successors, (374), 273 states have internal predecessors, (374), 3 states have call successors, (3), 3 states 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:31,747 INFO L74 IsIncluded]: Start isIncluded. First operand 579 states. Second operand has 278 states, 273 states have (on average 1.36996336996337) internal successors, (374), 273 states have internal predecessors, (374), 3 states have call successors, (3), 3 states 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:31,747 INFO L87 Difference]: Start difference. First operand 579 states. Second operand has 278 states, 273 states have (on average 1.36996336996337) internal successors, (374), 273 states have internal predecessors, (374), 3 states have call successors, (3), 3 states 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:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:31,762 INFO L93 Difference]: Finished difference Result 579 states and 778 transitions. [2022-04-27 11:17:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 778 transitions. [2022-04-27 11:17:31,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:31,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:31,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 278 states, 273 states have (on average 1.36996336996337) internal successors, (374), 273 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-27 11:17:31,764 INFO L87 Difference]: Start difference. First operand has 278 states, 273 states have (on average 1.36996336996337) internal successors, (374), 273 states have internal predecessors, (374), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 579 states. [2022-04-27 11:17:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:31,779 INFO L93 Difference]: Finished difference Result 579 states and 778 transitions. [2022-04-27 11:17:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 778 transitions. [2022-04-27 11:17:31,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:31,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:31,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:31,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 273 states have (on average 1.36996336996337) internal successors, (374), 273 states have internal predecessors, (374), 3 states have call successors, (3), 3 states 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:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 378 transitions. [2022-04-27 11:17:31,786 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 378 transitions. Word has length 32 [2022-04-27 11:17:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:31,786 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 378 transitions. [2022-04-27 11:17:31,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 23 states have internal predecessors, (37), 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:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 378 transitions. [2022-04-27 11:17:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 11:17:31,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:31,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:31,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-27 11:17:31,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-27 11:17:31,994 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:31,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash 74673410, now seen corresponding path program 7 times [2022-04-27 11:17:31,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:31,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884240544] [2022-04-27 11:17:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:31,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:32,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {28037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28025#true} is VALID [2022-04-27 11:17:32,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {28025#true} assume true; {28025#true} is VALID [2022-04-27 11:17:32,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28025#true} {28025#true} #83#return; {28025#true} is VALID [2022-04-27 11:17:32,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {28025#true} call ULTIMATE.init(); {28037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:32,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {28037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28025#true} is VALID [2022-04-27 11:17:32,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {28025#true} assume true; {28025#true} is VALID [2022-04-27 11:17:32,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28025#true} {28025#true} #83#return; {28025#true} is VALID [2022-04-27 11:17:32,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {28025#true} call #t~ret15 := main(); {28025#true} is VALID [2022-04-27 11:17:32,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {28025#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28025#true} is VALID [2022-04-27 11:17:32,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {28025#true} assume !(~x~0 % 4294967296 > 0); {28030#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:17:32,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {28030#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {28030#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:17:32,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {28030#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28031#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:17:32,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {28031#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28032#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:17:32,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {28032#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28033#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-27 11:17:32,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {28033#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:32,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:32,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:32,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:32,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:32,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:32,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-27 11:17:32,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {28034#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28035#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:32,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {28035#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28036#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-27 11:17:32,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {28036#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {28026#false} is VALID [2022-04-27 11:17:32,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {28026#false} assume !(~z~0 % 4294967296 > 0); {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L272 TraceCheckUtils]: 30: Hoare triple {28026#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {28026#false} ~cond := #in~cond; {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L290 TraceCheckUtils]: 32: Hoare triple {28026#false} assume 0 == ~cond; {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {28026#false} assume !false; {28026#false} is VALID [2022-04-27 11:17:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:17:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:32,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884240544] [2022-04-27 11:17:32,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884240544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:32,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539360599] [2022-04-27 11:17:32,164 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:17:32,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:32,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:32,165 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:32,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 11:17:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:32,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:17:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:32,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:32,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {28025#true} call ULTIMATE.init(); {28025#true} is VALID [2022-04-27 11:17:32,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {28025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28025#true} is VALID [2022-04-27 11:17:32,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {28025#true} assume true; {28025#true} is VALID [2022-04-27 11:17:32,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28025#true} {28025#true} #83#return; {28025#true} is VALID [2022-04-27 11:17:32,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {28025#true} call #t~ret15 := main(); {28025#true} is VALID [2022-04-27 11:17:32,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {28025#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28025#true} is VALID [2022-04-27 11:17:32,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:32,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:32,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:32,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:32,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:32,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28082#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:32,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {28082#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:32,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~y~0 % 4294967296 > 0); {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:32,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28082#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:32,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {28082#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28026#false} is VALID [2022-04-27 11:17:32,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {28026#false} assume !(~z~0 % 4294967296 > 0); {28026#false} is VALID [2022-04-27 11:17:32,430 INFO L272 TraceCheckUtils]: 30: Hoare triple {28026#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28026#false} is VALID [2022-04-27 11:17:32,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {28026#false} ~cond := #in~cond; {28026#false} is VALID [2022-04-27 11:17:32,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {28026#false} assume 0 == ~cond; {28026#false} is VALID [2022-04-27 11:17:32,430 INFO L290 TraceCheckUtils]: 33: Hoare triple {28026#false} assume !false; {28026#false} is VALID [2022-04-27 11:17:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-27 11:17:32,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:32,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {28026#false} assume !false; {28026#false} is VALID [2022-04-27 11:17:32,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {28026#false} assume 0 == ~cond; {28026#false} is VALID [2022-04-27 11:17:32,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {28026#false} ~cond := #in~cond; {28026#false} is VALID [2022-04-27 11:17:32,551 INFO L272 TraceCheckUtils]: 30: Hoare triple {28026#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28026#false} is VALID [2022-04-27 11:17:32,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {28026#false} assume !(~z~0 % 4294967296 > 0); {28026#false} is VALID [2022-04-27 11:17:32,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {28026#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28026#false} is VALID [2022-04-27 11:17:32,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {28082#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28026#false} is VALID [2022-04-27 11:17:32,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28082#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:32,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:32,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~y~0 % 4294967296 > 0); {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {28090#(< 0 (mod (+ main_~x~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; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28090#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:32,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {28082#(< 0 (mod main_~x~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28086#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:32,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28082#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:17:32,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:32,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:32,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:32,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28069#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-27 11:17:32,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28065#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:17:32,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {28025#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {28025#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {28025#true} call #t~ret15 := main(); {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28025#true} {28025#true} #83#return; {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {28025#true} assume true; {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {28025#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {28025#true} call ULTIMATE.init(); {28025#true} is VALID [2022-04-27 11:17:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-27 11:17:32,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539360599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:32,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:32,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-04-27 11:17:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003306147] [2022-04-27 11:17:32,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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 34 [2022-04-27 11:17:32,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:32,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:17:32,601 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:17:32,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:17:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:17:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:17:32,601 INFO L87 Difference]: Start difference. First operand 278 states and 378 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:17:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:35,000 INFO L93 Difference]: Finished difference Result 493 states and 712 transitions. [2022-04-27 11:17:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 11:17:35,000 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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 34 [2022-04-27 11:17:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:17:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2022-04-27 11:17:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:17:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2022-04-27 11:17:35,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 130 transitions. [2022-04-27 11:17:35,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:35,172 INFO L225 Difference]: With dead ends: 493 [2022-04-27 11:17:35,172 INFO L226 Difference]: Without dead ends: 474 [2022-04-27 11:17:35,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:17:35,173 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 141 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:35,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 68 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:17:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-27 11:17:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 381. [2022-04-27 11:17:36,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:36,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 381 states, 376 states have (on average 1.428191489361702) internal successors, (537), 376 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:36,210 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 381 states, 376 states have (on average 1.428191489361702) internal successors, (537), 376 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:36,211 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 381 states, 376 states have (on average 1.428191489361702) internal successors, (537), 376 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:36,221 INFO L93 Difference]: Finished difference Result 474 states and 658 transitions. [2022-04-27 11:17:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 658 transitions. [2022-04-27 11:17:36,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:36,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:36,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 376 states have (on average 1.428191489361702) internal successors, (537), 376 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 474 states. [2022-04-27 11:17:36,223 INFO L87 Difference]: Start difference. First operand has 381 states, 376 states have (on average 1.428191489361702) internal successors, (537), 376 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 474 states. [2022-04-27 11:17:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:36,233 INFO L93 Difference]: Finished difference Result 474 states and 658 transitions. [2022-04-27 11:17:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 658 transitions. [2022-04-27 11:17:36,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:36,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:36,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:36,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 376 states have (on average 1.428191489361702) internal successors, (537), 376 states have internal predecessors, (537), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 541 transitions. [2022-04-27 11:17:36,243 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 541 transitions. Word has length 34 [2022-04-27 11:17:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:36,244 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 541 transitions. [2022-04-27 11:17:36,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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:17:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 541 transitions. [2022-04-27 11:17:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:17:36,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:36,245 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:36,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-27 11:17:36,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-27 11:17:36,456 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:36,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 8 times [2022-04-27 11:17:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:36,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528207894] [2022-04-27 11:17:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:37,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {30462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30444#true} is VALID [2022-04-27 11:17:37,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {30444#true} assume true; {30444#true} is VALID [2022-04-27 11:17:37,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30444#true} {30444#true} #83#return; {30444#true} is VALID [2022-04-27 11:17:37,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {30444#true} call ULTIMATE.init(); {30462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:37,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {30462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30444#true} is VALID [2022-04-27 11:17:37,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {30444#true} assume true; {30444#true} is VALID [2022-04-27 11:17:37,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30444#true} {30444#true} #83#return; {30444#true} is VALID [2022-04-27 11:17:37,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {30444#true} call #t~ret15 := main(); {30444#true} is VALID [2022-04-27 11:17:37,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {30444#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30450#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-27 11:17:37,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {30450#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30451#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-27 11:17:37,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {30451#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 2 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30452#(and (< (div main_~n~0 4294967296) (+ (div main_~x~0 4294967296) 1)) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:17:37,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {30452#(and (< (div main_~n~0 4294967296) (+ (div main_~x~0 4294967296) 1)) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:17:37,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-27 11:17:37,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} ~z~0 := ~y~0; {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-27 11:17:37,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30455#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:17:37,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {30455#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30456#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:17:37,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {30456#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= 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; {30457#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:17:37,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {30457#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:17:37,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~z~0 % 4294967296 > 0); {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:17:37,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:17:37,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:17:37,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:17:37,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:17:37,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-27 11:17:37,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {30458#(and (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30457#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:17:37,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {30457#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30456#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:17:37,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {30456#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30455#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:17:37,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {30455#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-27 11:17:37,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-27 11:17:37,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {30454#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30455#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-27 11:17:37,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {30455#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30456#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-27 11:17:37,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {30456#(and (<= (+ main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30457#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-27 11:17:37,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {30457#(and (<= (+ main_~x~0 1) main_~n~0) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:37,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:37,246 INFO L272 TraceCheckUtils]: 32: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30460#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:17:37,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {30460#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30461#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:17:37,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {30461#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30445#false} is VALID [2022-04-27 11:17:37,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {30445#false} assume !false; {30445#false} is VALID [2022-04-27 11:17:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:17:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:37,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528207894] [2022-04-27 11:17:37,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528207894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:37,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189243677] [2022-04-27 11:17:37,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:17:37,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:37,252 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:37,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 11:17:37,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:17:37,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:37,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-27 11:17:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:37,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:37,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {30444#true} call ULTIMATE.init(); {30444#true} is VALID [2022-04-27 11:17:37,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {30444#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30444#true} is VALID [2022-04-27 11:17:37,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {30444#true} assume true; {30444#true} is VALID [2022-04-27 11:17:37,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30444#true} {30444#true} #83#return; {30444#true} is VALID [2022-04-27 11:17:37,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {30444#true} call #t~ret15 := main(); {30444#true} is VALID [2022-04-27 11:17:37,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {30444#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30484#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:17:37,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {30484#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30488#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:17:37,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {30488#(= 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; {30492#(= (+ main_~x~0 3) main_~n~0)} is VALID [2022-04-27 11:17:37,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {30492#(= (+ main_~x~0 3) 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; {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:17:37,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:17:37,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:17:37,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30492#(= (+ main_~x~0 3) main_~n~0)} is VALID [2022-04-27 11:17:37,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {30492#(= (+ main_~x~0 3) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30488#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:17:37,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {30488#(= 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; {30484#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:17:37,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {30484#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) 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; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) 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; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) 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; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) 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; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30484#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:17:37,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {30484#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30488#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:17:37,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {30488#(= main_~n~0 (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30492#(= (+ main_~x~0 3) main_~n~0)} is VALID [2022-04-27 11:17:37,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {30492#(= (+ main_~x~0 3) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:17:37,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-27 11:17:37,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {30453#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30492#(= (+ main_~x~0 3) main_~n~0)} is VALID [2022-04-27 11:17:37,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {30492#(= (+ main_~x~0 3) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30488#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-27 11:17:37,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {30488#(= main_~n~0 (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30484#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-27 11:17:37,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {30484#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 11:17:37,581 INFO L272 TraceCheckUtils]: 32: Hoare triple {30449#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30565#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:37,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {30565#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30569#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:37,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {30569#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30445#false} is VALID [2022-04-27 11:17:37,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {30445#false} assume !false; {30445#false} is VALID [2022-04-27 11:17:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:17:37,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:38,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {30445#false} assume !false; {30445#false} is VALID [2022-04-27 11:17:38,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {30569#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30445#false} is VALID [2022-04-27 11:17:38,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {30565#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30569#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:17:38,121 INFO L272 TraceCheckUtils]: 32: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30565#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:17:38,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:17:38,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:38,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:38,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:17:38,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (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; {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 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; {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~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; {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:17:38,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:38,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:38,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 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; {30603#(and (< (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 11:17:38,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (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; {30599#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-27 11:17:38,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {30595#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30591#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-27 11:17:38,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {30444#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30459#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 11:17:38,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {30444#true} call #t~ret15 := main(); {30444#true} is VALID [2022-04-27 11:17:38,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30444#true} {30444#true} #83#return; {30444#true} is VALID [2022-04-27 11:17:38,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {30444#true} assume true; {30444#true} is VALID [2022-04-27 11:17:38,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {30444#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30444#true} is VALID [2022-04-27 11:17:38,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {30444#true} call ULTIMATE.init(); {30444#true} is VALID [2022-04-27 11:17:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:17:38,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189243677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:38,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:38,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 25 [2022-04-27 11:17:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180312453] [2022-04-27 11:17:38,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:38,141 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 22 states have internal predecessors, (78), 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 36 [2022-04-27 11:17:38,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:38,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 3.12) internal successors, (78), 22 states have internal predecessors, (78), 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:38,257 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:38,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-27 11:17:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:38,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-27 11:17:38,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:17:38,258 INFO L87 Difference]: Start difference. First operand 381 states and 541 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 22 states have internal predecessors, (78), 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:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:40,465 INFO L93 Difference]: Finished difference Result 391 states and 550 transitions. [2022-04-27 11:17:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:17:40,465 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 22 states have internal predecessors, (78), 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 36 [2022-04-27 11:17:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:17:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 22 states have internal predecessors, (78), 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:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-27 11:17:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 22 states have internal predecessors, (78), 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:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-27 11:17:40,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-27 11:17:40,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:17:40,546 INFO L225 Difference]: With dead ends: 391 [2022-04-27 11:17:40,546 INFO L226 Difference]: Without dead ends: 365 [2022-04-27 11:17:40,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=1114, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:17:40,547 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:17:40,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 81 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:17:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-27 11:17:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-04-27 11:17:41,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:17:41,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 365 states, 360 states have (on average 1.4444444444444444) internal successors, (520), 360 states have internal predecessors, (520), 3 states have call successors, (3), 3 states 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:41,528 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 365 states, 360 states have (on average 1.4444444444444444) internal successors, (520), 360 states have internal predecessors, (520), 3 states have call successors, (3), 3 states 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:41,528 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 365 states, 360 states have (on average 1.4444444444444444) internal successors, (520), 360 states have internal predecessors, (520), 3 states have call successors, (3), 3 states 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:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:41,533 INFO L93 Difference]: Finished difference Result 365 states and 524 transitions. [2022-04-27 11:17:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 524 transitions. [2022-04-27 11:17:41,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:41,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:41,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 360 states have (on average 1.4444444444444444) internal successors, (520), 360 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-27 11:17:41,534 INFO L87 Difference]: Start difference. First operand has 365 states, 360 states have (on average 1.4444444444444444) internal successors, (520), 360 states have internal predecessors, (520), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-27 11:17:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:17:41,540 INFO L93 Difference]: Finished difference Result 365 states and 524 transitions. [2022-04-27 11:17:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 524 transitions. [2022-04-27 11:17:41,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:17:41,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:17:41,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:17:41,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:17:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.4444444444444444) internal successors, (520), 360 states have internal predecessors, (520), 3 states have call successors, (3), 3 states 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:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 524 transitions. [2022-04-27 11:17:41,550 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 524 transitions. Word has length 36 [2022-04-27 11:17:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:17:41,550 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 524 transitions. [2022-04-27 11:17:41,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 22 states have internal predecessors, (78), 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:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 524 transitions. [2022-04-27 11:17:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:17:41,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:17:41,551 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:17:41,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 11:17:41,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-27 11:17:41,773 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:17:41,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:17:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1930026878, now seen corresponding path program 6 times [2022-04-27 11:17:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:17:41,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976093132] [2022-04-27 11:17:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:17:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:17:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:41,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:17:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:42,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {32541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32522#true} is VALID [2022-04-27 11:17:42,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {32522#true} assume true; {32522#true} is VALID [2022-04-27 11:17:42,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32522#true} {32522#true} #83#return; {32522#true} is VALID [2022-04-27 11:17:42,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {32522#true} call ULTIMATE.init(); {32541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:17:42,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {32541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32522#true} is VALID [2022-04-27 11:17:42,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {32522#true} assume true; {32522#true} is VALID [2022-04-27 11:17:42,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32522#true} {32522#true} #83#return; {32522#true} is VALID [2022-04-27 11:17:42,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {32522#true} call #t~ret15 := main(); {32522#true} is VALID [2022-04-27 11:17:42,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {32522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32527#(= main_~y~0 0)} is VALID [2022-04-27 11:17:42,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {32527#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:42,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {32528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:42,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {32529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:42,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {32530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32531#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:42,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {32531#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32532#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:42,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {32532#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32534#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:17:42,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {32534#(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; {32535#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:17:42,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {32535#(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; {32536#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:17:42,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {32536#(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; {32537#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:17:42,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {32537#(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; {32538#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:17:42,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {32538#(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; {32539#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:17:42,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {32539#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32540#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:17:42,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {32540#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32523#false} is VALID [2022-04-27 11:17:42,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {32523#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {32523#false} assume !(~z~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {32523#false} assume !(~y~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {32523#false} assume !(~x~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {32523#false} assume !(~z~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L272 TraceCheckUtils]: 32: Hoare triple {32523#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {32523#false} ~cond := #in~cond; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {32523#false} assume 0 == ~cond; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {32523#false} assume !false; {32523#false} is VALID [2022-04-27 11:17:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:17:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976093132] [2022-04-27 11:17:42,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976093132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:17:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527168895] [2022-04-27 11:17:42,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:17:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:17:42,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:17:42,010 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:17:42,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-27 11:17:42,129 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-27 11:17:42,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:17:42,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 11:17:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:17:42,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:17:42,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {32522#true} call ULTIMATE.init(); {32522#true} is VALID [2022-04-27 11:17:42,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {32522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32522#true} is VALID [2022-04-27 11:17:42,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {32522#true} assume true; {32522#true} is VALID [2022-04-27 11:17:42,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32522#true} {32522#true} #83#return; {32522#true} is VALID [2022-04-27 11:17:42,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {32522#true} call #t~ret15 := main(); {32522#true} is VALID [2022-04-27 11:17:42,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {32522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32527#(= main_~y~0 0)} is VALID [2022-04-27 11:17:42,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {32527#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:17:42,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {32528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:17:42,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {32529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:17:42,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {32530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32531#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:17:42,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {32531#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32532#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:17:42,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {32532#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {32533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32584#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {32584#(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; {32588#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:17:42,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {32588#(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; {32592#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {32592#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32596#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {32596#(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; {32600#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {32600#(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; {32604#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {32604#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32608#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {32608#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)) (<= 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; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {32523#false} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {32523#false} assume !(~z~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {32523#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {32523#false} assume !(~y~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {32523#false} assume !(~x~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {32523#false} assume !(~z~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L272 TraceCheckUtils]: 32: Hoare triple {32523#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {32523#false} ~cond := #in~cond; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {32523#false} assume 0 == ~cond; {32523#false} is VALID [2022-04-27 11:17:42,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {32523#false} assume !false; {32523#false} is VALID [2022-04-27 11:17:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:42,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:17:42,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {32523#false} assume !false; {32523#false} is VALID [2022-04-27 11:17:42,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {32523#false} assume 0 == ~cond; {32523#false} is VALID [2022-04-27 11:17:42,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {32523#false} ~cond := #in~cond; {32523#false} is VALID [2022-04-27 11:17:42,901 INFO L272 TraceCheckUtils]: 32: Hoare triple {32523#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32523#false} is VALID [2022-04-27 11:17:42,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {32523#false} assume !(~z~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {32523#false} assume !(~x~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {32675#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {32523#false} is VALID [2022-04-27 11:17:42,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {32679#(< 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; {32675#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:17:42,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {32683#(< 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; {32679#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:17:42,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {32687#(< 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; {32683#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:17:42,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {32691#(< 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; {32687#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:17:42,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {32695#(< 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; {32691#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:42,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {32699#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32695#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:42,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {32699#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {32699#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:42,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {32699#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32699#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:42,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {32709#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32699#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:17:42,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {32713#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32709#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:17:42,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {32717#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32713#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:17:42,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {32721#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32717#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:17:42,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {32725#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32721#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:17:42,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {32729#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32725#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:17:42,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {32733#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32729#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:17:42,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {32522#true} ~z~0 := ~y~0; {32733#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:17:42,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {32522#true} assume !(~x~0 % 4294967296 > 0); {32522#true} is VALID [2022-04-27 11:17:42,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {32522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32522#true} is VALID [2022-04-27 11:17:42,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {32522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32522#true} is VALID [2022-04-27 11:17:42,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {32522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32522#true} is VALID [2022-04-27 11:17:42,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {32522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32522#true} is VALID [2022-04-27 11:17:42,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {32522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32522#true} is VALID [2022-04-27 11:17:42,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {32522#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32522#true} is VALID [2022-04-27 11:17:42,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {32522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32522#true} is VALID [2022-04-27 11:17:42,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {32522#true} call #t~ret15 := main(); {32522#true} is VALID [2022-04-27 11:17:42,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32522#true} {32522#true} #83#return; {32522#true} is VALID [2022-04-27 11:17:42,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {32522#true} assume true; {32522#true} is VALID [2022-04-27 11:17:42,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {32522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32522#true} is VALID [2022-04-27 11:17:42,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {32522#true} call ULTIMATE.init(); {32522#true} is VALID [2022-04-27 11:17:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:17:42,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527168895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:17:42,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:17:42,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-27 11:17:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026670774] [2022-04-27 11:17:42,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:17:42,925 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:17:42,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:17:42,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:17:42,979 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:17:42,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:17:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:17:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:17:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:17:42,980 INFO L87 Difference]: Start difference. First operand 365 states and 524 transitions. Second operand has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:02,510 INFO L93 Difference]: Finished difference Result 947 states and 1296 transitions. [2022-04-27 11:18:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-04-27 11:18:02,510 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:18:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 419 transitions. [2022-04-27 11:18:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 419 transitions. [2022-04-27 11:18:02,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 419 transitions. [2022-04-27 11:18:03,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:03,250 INFO L225 Difference]: With dead ends: 947 [2022-04-27 11:18:03,250 INFO L226 Difference]: Without dead ends: 897 [2022-04-27 11:18:03,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10587 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=4463, Invalid=25293, Unknown=0, NotChecked=0, Total=29756 [2022-04-27 11:18:03,251 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 349 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:03,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 129 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-27 11:18:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-27 11:18:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 429. [2022-04-27 11:18:04,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:04,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 429 states, 424 states have (on average 1.4504716981132075) internal successors, (615), 424 states have internal predecessors, (615), 3 states have call successors, (3), 3 states 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:04,366 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 429 states, 424 states have (on average 1.4504716981132075) internal successors, (615), 424 states have internal predecessors, (615), 3 states have call successors, (3), 3 states 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:04,366 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 429 states, 424 states have (on average 1.4504716981132075) internal successors, (615), 424 states have internal predecessors, (615), 3 states have call successors, (3), 3 states 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:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:04,400 INFO L93 Difference]: Finished difference Result 897 states and 1145 transitions. [2022-04-27 11:18:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1145 transitions. [2022-04-27 11:18:04,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:04,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:04,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 424 states have (on average 1.4504716981132075) internal successors, (615), 424 states have internal predecessors, (615), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 897 states. [2022-04-27 11:18:04,402 INFO L87 Difference]: Start difference. First operand has 429 states, 424 states have (on average 1.4504716981132075) internal successors, (615), 424 states have internal predecessors, (615), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 897 states. [2022-04-27 11:18:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:04,435 INFO L93 Difference]: Finished difference Result 897 states and 1145 transitions. [2022-04-27 11:18:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1145 transitions. [2022-04-27 11:18:04,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:04,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:04,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:04,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 424 states have (on average 1.4504716981132075) internal successors, (615), 424 states have internal predecessors, (615), 3 states have call successors, (3), 3 states 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:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 619 transitions. [2022-04-27 11:18:04,447 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 619 transitions. Word has length 36 [2022-04-27 11:18:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:04,447 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 619 transitions. [2022-04-27 11:18:04,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 619 transitions. [2022-04-27 11:18:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:18:04,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:04,448 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:04,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-27 11:18:04,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:04,653 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1644820974, now seen corresponding path program 7 times [2022-04-27 11:18:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:04,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855327123] [2022-04-27 11:18:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:04,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {36578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36561#true} is VALID [2022-04-27 11:18:04,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {36561#true} assume true; {36561#true} is VALID [2022-04-27 11:18:04,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36561#true} {36561#true} #83#return; {36561#true} is VALID [2022-04-27 11:18:04,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {36561#true} call ULTIMATE.init(); {36578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:04,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {36578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36561#true} is VALID [2022-04-27 11:18:04,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {36561#true} assume true; {36561#true} is VALID [2022-04-27 11:18:04,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36561#true} {36561#true} #83#return; {36561#true} is VALID [2022-04-27 11:18:04,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {36561#true} call #t~ret15 := main(); {36561#true} is VALID [2022-04-27 11:18:04,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {36561#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36566#(= main_~y~0 0)} is VALID [2022-04-27 11:18:04,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {36566#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36567#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:04,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {36567#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36568#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:04,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {36568#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36569#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:04,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {36569#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36570#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:04,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {36570#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36571#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:04,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {36571#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36572#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:04,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {36572#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:04,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:04,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {36574#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:18:04,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {36574#(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; {36575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:18:04,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {36575#(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; {36576#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:18:04,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {36576#(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; {36577#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {36577#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {36562#false} assume !(~y~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:04,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {36562#false} assume !(~x~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {36562#false} assume !(~z~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L272 TraceCheckUtils]: 32: Hoare triple {36562#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {36562#false} ~cond := #in~cond; {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {36562#false} assume 0 == ~cond; {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {36562#false} assume !false; {36562#false} is VALID [2022-04-27 11:18:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-27 11:18:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855327123] [2022-04-27 11:18:04,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855327123] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267029098] [2022-04-27 11:18:04,861 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:18:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:04,864 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:04,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 11:18:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:04,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 11:18:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:04,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:05,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {36561#true} call ULTIMATE.init(); {36561#true} is VALID [2022-04-27 11:18:05,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {36561#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36561#true} is VALID [2022-04-27 11:18:05,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {36561#true} assume true; {36561#true} is VALID [2022-04-27 11:18:05,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36561#true} {36561#true} #83#return; {36561#true} is VALID [2022-04-27 11:18:05,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {36561#true} call #t~ret15 := main(); {36561#true} is VALID [2022-04-27 11:18:05,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {36561#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36566#(= main_~y~0 0)} is VALID [2022-04-27 11:18:05,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {36566#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36567#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:05,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {36567#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36568#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:05,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {36568#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36569#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:05,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {36569#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36570#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:05,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {36570#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36571#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:05,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {36571#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36572#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:05,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {36572#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:05,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:05,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {36573#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {36574#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:18:05,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {36574#(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; {36575#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:18:05,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {36575#(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; {36576#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:18:05,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {36576#(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; {36633#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {36633#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {36562#false} assume !(~y~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {36562#false} assume !(~x~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {36562#false} assume !(~z~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L272 TraceCheckUtils]: 32: Hoare triple {36562#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {36562#false} ~cond := #in~cond; {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {36562#false} assume 0 == ~cond; {36562#false} is VALID [2022-04-27 11:18:05,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {36562#false} assume !false; {36562#false} is VALID [2022-04-27 11:18:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-27 11:18:05,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:05,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {36562#false} assume !false; {36562#false} is VALID [2022-04-27 11:18:05,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {36562#false} assume 0 == ~cond; {36562#false} is VALID [2022-04-27 11:18:05,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {36562#false} ~cond := #in~cond; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L272 TraceCheckUtils]: 32: Hoare triple {36562#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {36562#false} assume !(~z~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {36562#false} assume !(~x~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {36562#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {36562#false} assume !(~y~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {36562#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36562#false} is VALID [2022-04-27 11:18:05,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {36739#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36562#false} is VALID [2022-04-27 11:18:05,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {36743#(< 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; {36739#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:05,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {36747#(< 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; {36743#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:05,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {36751#(< 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; {36747#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:18:05,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {36755#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {36751#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:18:05,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {36755#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {36755#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:18:05,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {36762#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {36755#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:18:05,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {36766#(< 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; {36762#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:18:05,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {36770#(< 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; {36766#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:05,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {36774#(< 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; {36770#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:18:05,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {36778#(< 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; {36774#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:18:05,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {36782#(< 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; {36778#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:18:05,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {36786#(< 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; {36782#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:18:05,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {36561#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36786#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:18:05,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {36561#true} call #t~ret15 := main(); {36561#true} is VALID [2022-04-27 11:18:05,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36561#true} {36561#true} #83#return; {36561#true} is VALID [2022-04-27 11:18:05,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {36561#true} assume true; {36561#true} is VALID [2022-04-27 11:18:05,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {36561#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {36561#true} is VALID [2022-04-27 11:18:05,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {36561#true} call ULTIMATE.init(); {36561#true} is VALID [2022-04-27 11:18:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-27 11:18:05,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267029098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:05,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:05,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-27 11:18:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195473053] [2022-04-27 11:18:05,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:05,619 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 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 36 [2022-04-27 11:18:05,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:05,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 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:18:05,657 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:18:05,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:18:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:05,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:18:05,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:18:05,658 INFO L87 Difference]: Start difference. First operand 429 states and 619 transitions. Second operand has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 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:18:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:45,145 INFO L93 Difference]: Finished difference Result 986 states and 1379 transitions. [2022-04-27 11:18:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-04-27 11:18:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 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 36 [2022-04-27 11:18:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 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:18:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 477 transitions. [2022-04-27 11:18:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 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:18:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 477 transitions. [2022-04-27 11:18:45,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 477 transitions. [2022-04-27 11:18:47,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:47,100 INFO L225 Difference]: With dead ends: 986 [2022-04-27 11:18:47,100 INFO L226 Difference]: Without dead ends: 921 [2022-04-27 11:18:47,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14071 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=6269, Invalid=29641, Unknown=0, NotChecked=0, Total=35910 [2022-04-27 11:18:47,102 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 542 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:47,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 127 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-27 11:18:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-04-27 11:18:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 482. [2022-04-27 11:18:48,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:48,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 921 states. Second operand has 482 states, 477 states have (on average 1.4360587002096437) internal successors, (685), 477 states have internal predecessors, (685), 3 states have call successors, (3), 3 states 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:48,460 INFO L74 IsIncluded]: Start isIncluded. First operand 921 states. Second operand has 482 states, 477 states have (on average 1.4360587002096437) internal successors, (685), 477 states have internal predecessors, (685), 3 states have call successors, (3), 3 states 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:48,460 INFO L87 Difference]: Start difference. First operand 921 states. Second operand has 482 states, 477 states have (on average 1.4360587002096437) internal successors, (685), 477 states have internal predecessors, (685), 3 states have call successors, (3), 3 states 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:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:48,487 INFO L93 Difference]: Finished difference Result 921 states and 1266 transitions. [2022-04-27 11:18:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1266 transitions. [2022-04-27 11:18:48,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:48,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:48,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 482 states, 477 states have (on average 1.4360587002096437) internal successors, (685), 477 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 921 states. [2022-04-27 11:18:48,489 INFO L87 Difference]: Start difference. First operand has 482 states, 477 states have (on average 1.4360587002096437) internal successors, (685), 477 states have internal predecessors, (685), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 921 states. [2022-04-27 11:18:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:48,525 INFO L93 Difference]: Finished difference Result 921 states and 1266 transitions. [2022-04-27 11:18:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1266 transitions. [2022-04-27 11:18:48,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:48,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:48,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:48,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 477 states have (on average 1.4360587002096437) internal successors, (685), 477 states have internal predecessors, (685), 3 states have call successors, (3), 3 states 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:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 689 transitions. [2022-04-27 11:18:48,547 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 689 transitions. Word has length 36 [2022-04-27 11:18:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:48,547 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 689 transitions. [2022-04-27 11:18:48,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 27 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:18:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 689 transitions. [2022-04-27 11:18:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:18:48,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:48,548 INFO L195 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:48,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 11:18:48,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 11:18:48,767 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:48,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash 319091791, now seen corresponding path program 8 times [2022-04-27 11:18:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:48,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99558222] [2022-04-27 11:18:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:49,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {40839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40815#true} is VALID [2022-04-27 11:18:49,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {40815#true} assume true; {40815#true} is VALID [2022-04-27 11:18:49,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40815#true} {40815#true} #83#return; {40815#true} is VALID [2022-04-27 11:18:49,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {40815#true} call ULTIMATE.init(); {40839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:49,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {40839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40815#true} is VALID [2022-04-27 11:18:49,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {40815#true} assume true; {40815#true} is VALID [2022-04-27 11:18:49,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40815#true} {40815#true} #83#return; {40815#true} is VALID [2022-04-27 11:18:49,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {40815#true} call #t~ret15 := main(); {40815#true} is VALID [2022-04-27 11:18:49,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {40815#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40820#(= main_~y~0 0)} is VALID [2022-04-27 11:18:49,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {40820#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40821#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:49,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {40821#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40822#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:49,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {40822#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40823#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:49,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {40823#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40824#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:49,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {40824#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40825#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:49,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {40825#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40826#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {40826#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40827#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:49,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {40827#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40828#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:18:49,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {40828#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40829#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:18:49,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {40829#(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; {40830#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:18:49,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {40830#(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; {40831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:18:49,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {40831#(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; {40832#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:18:49,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {40832#(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; {40833#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:18:49,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {40833#(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; {40834#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:18:49,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {40834#(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; {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:49,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:49,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:49,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {40836#(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; {40837#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:18:49,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {40837#(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; {40838#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {40838#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {40816#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {40816#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {40816#false} assume !(~y~0 % 4294967296 > 0); {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {40816#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {40816#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {40816#false} assume !(~x~0 % 4294967296 > 0); {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {40816#false} assume !(~z~0 % 4294967296 > 0); {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L272 TraceCheckUtils]: 33: Hoare triple {40816#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {40816#false} ~cond := #in~cond; {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {40816#false} assume 0 == ~cond; {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {40816#false} assume !false; {40816#false} is VALID [2022-04-27 11:18:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:18:49,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:49,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99558222] [2022-04-27 11:18:49,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99558222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:49,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296249080] [2022-04-27 11:18:49,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:18:49,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:49,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:49,130 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:49,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-27 11:18:49,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:18:49,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:18:49,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-27 11:18:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:49,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:49,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {40815#true} call ULTIMATE.init(); {40815#true} is VALID [2022-04-27 11:18:49,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {40815#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40815#true} is VALID [2022-04-27 11:18:49,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {40815#true} assume true; {40815#true} is VALID [2022-04-27 11:18:49,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40815#true} {40815#true} #83#return; {40815#true} is VALID [2022-04-27 11:18:49,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {40815#true} call #t~ret15 := main(); {40815#true} is VALID [2022-04-27 11:18:49,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {40815#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40820#(= main_~y~0 0)} is VALID [2022-04-27 11:18:49,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {40820#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40821#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:49,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {40821#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40822#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:49,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {40822#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40823#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:49,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {40823#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40824#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:49,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {40824#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40825#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:49,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {40825#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40826#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {40826#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40827#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:18:49,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {40827#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40828#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:18:49,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {40828#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {40829#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:18:49,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {40829#(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; {40830#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:18:49,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {40830#(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; {40831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:18:49,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {40831#(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; {40832#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:18:49,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {40832#(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; {40833#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-27 11:18:49,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {40833#(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; {40834#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-27 11:18:49,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {40834#(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; {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:49,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-27 11:18:49,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {40835#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:49,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {40836#(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; {40837#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:18:49,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {40837#(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; {40915#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:18:49,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {40915#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {40915#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-27 11:18:49,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {40915#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40837#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-27 11:18:49,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {40837#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:49,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~y~0 % 4294967296 > 0); {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:49,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:49,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:49,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~x~0 % 4294967296 > 0); {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-27 11:18:49,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {40836#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40816#false} is VALID [2022-04-27 11:18:49,550 INFO L272 TraceCheckUtils]: 33: Hoare triple {40816#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40816#false} is VALID [2022-04-27 11:18:49,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {40816#false} ~cond := #in~cond; {40816#false} is VALID [2022-04-27 11:18:49,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {40816#false} assume 0 == ~cond; {40816#false} is VALID [2022-04-27 11:18:49,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {40816#false} assume !false; {40816#false} is VALID [2022-04-27 11:18:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:18:49,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:50,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {40816#false} assume !false; {40816#false} is VALID [2022-04-27 11:18:50,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {40816#false} assume 0 == ~cond; {40816#false} is VALID [2022-04-27 11:18:50,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {40816#false} ~cond := #in~cond; {40816#false} is VALID [2022-04-27 11:18:50,137 INFO L272 TraceCheckUtils]: 33: Hoare triple {40816#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40816#false} is VALID [2022-04-27 11:18:50,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {40964#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40816#false} is VALID [2022-04-27 11:18:50,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {40964#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40964#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:50,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {40964#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40964#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:50,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {40964#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40964#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:50,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {40964#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40964#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:50,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {40980#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40964#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:50,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {40984#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40980#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-27 11:18:50,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {40984#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {40984#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-27 11:18:50,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {40980#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40984#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-27 11:18:50,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {40964#(< 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; {40980#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-27 11:18:50,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {40997#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {40964#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:18:50,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {40997#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40997#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:18:50,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {41004#(< 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; {40997#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:18:50,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {41008#(< 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; {41004#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:18:50,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {41012#(< 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; {41008#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:18:50,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {41016#(< 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; {41012#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:18:50,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {41020#(< 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; {41016#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-27 11:18:50,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {41024#(< 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; {41020#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {41028#(< 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; {41024#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-27 11:18:50,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {41032#(< 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; {41028#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {41036#(< 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; {41032#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-27 11:18:50,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {41040#(< 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; {41036#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-27 11:18:50,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {41044#(< 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; {41040#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-27 11:18:50,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {41048#(< 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; {41044#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-27 11:18:50,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {41052#(< 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; {41048#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-27 11:18:50,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {41056#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41052#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-27 11:18:50,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {41060#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41056#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-27 11:18:50,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {40815#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41060#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-27 11:18:50,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {40815#true} call #t~ret15 := main(); {40815#true} is VALID [2022-04-27 11:18:50,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40815#true} {40815#true} #83#return; {40815#true} is VALID [2022-04-27 11:18:50,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {40815#true} assume true; {40815#true} is VALID [2022-04-27 11:18:50,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {40815#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {40815#true} is VALID [2022-04-27 11:18:50,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {40815#true} call ULTIMATE.init(); {40815#true} is VALID [2022-04-27 11:18:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:18:50,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296249080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:50,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:50,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-27 11:18:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993437003] [2022-04-27 11:18:50,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:50,153 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 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 37 [2022-04-27 11:18:50,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:50,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 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:50,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:50,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:18:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:18:50,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:18:50,202 INFO L87 Difference]: Start difference. First operand 482 states and 689 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 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:19:15,636 WARN L232 SmtUtils]: Spent 12.53s 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:19:26,724 WARN L232 SmtUtils]: Spent 5.94s 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:51,578 WARN L232 SmtUtils]: Spent 14.94s 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:20:03,217 WARN L232 SmtUtils]: Spent 6.75s 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:20:26,491 WARN L232 SmtUtils]: Spent 15.90s 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:20:50,160 WARN L232 SmtUtils]: Spent 15.62s 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:21:06,997 WARN L232 SmtUtils]: Spent 7.68s 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:21:23,853 WARN L232 SmtUtils]: Spent 11.42s 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:48,126 WARN L232 SmtUtils]: Spent 5.02s 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:07,394 WARN L232 SmtUtils]: Spent 11.43s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:22:40,338 WARN L232 SmtUtils]: Spent 8.45s 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:23:19,144 WARN L232 SmtUtils]: Spent 5.94s 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:23:27,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:23:32,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:23:45,509 WARN L232 SmtUtils]: Spent 8.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:24:14,527 WARN L232 SmtUtils]: Spent 8.15s 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:24:25,104 WARN L232 SmtUtils]: Spent 5.97s 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:24:53,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:25:30,760 WARN L232 SmtUtils]: Spent 5.37s 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:26:27,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:26:40,735 WARN L232 SmtUtils]: Spent 6.27s 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)