/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-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 11:51:07,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 11:51:07,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 11:51:07,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 11:51:07,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 11:51:07,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 11:51:07,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 11:51:07,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 11:51:07,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 11:51:07,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 11:51:07,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 11:51:07,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 11:51:07,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 11:51:07,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 11:51:07,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 11:51:07,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 11:51:07,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 11:51:07,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 11:51:07,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 11:51:07,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 11:51:07,561 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 11:51:07,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 11:51:07,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 11:51:07,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 11:51:07,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 11:51:07,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 11:51:07,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 11:51:07,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 11:51:07,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 11:51:07,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 11:51:07,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 11:51:07,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 11:51:07,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 11:51:07,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 11:51:07,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 11:51:07,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 11:51:07,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 11:51:07,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 11:51:07,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 11:51:07,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 11:51:07,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 11:51:07,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 11:51:07,587 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-07 11:51:07,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 11:51:07,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 11:51:07,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 11:51:07,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 11:51:07,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 11:51:07,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 11:51:07,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 11:51:07,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 11:51:07,619 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 11:51:07,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 11:51:07,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 11:51:07,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 11:51:07,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 11:51:07,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 11:51:07,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 11:51:07,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 11:51:07,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 11:51:07,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:51:07,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 11:51:07,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 11:51:07,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 11:51:07,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 11:51:07,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 11:51:07,623 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 11:51:07,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 11:51:07,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 11:51:07,623 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-07 11:51:07,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 11:51:07,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 11:51:07,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 11:51:07,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 11:51:07,811 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 11:51:07,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-07 11:51:07,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4122b29/4e5a3844387e4ee2abd3351caa91b473/FLAG76fef2704 [2022-04-07 11:51:08,196 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 11:51:08,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-07 11:51:08,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4122b29/4e5a3844387e4ee2abd3351caa91b473/FLAG76fef2704 [2022-04-07 11:51:08,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4122b29/4e5a3844387e4ee2abd3351caa91b473 [2022-04-07 11:51:08,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 11:51:08,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 11:51:08,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 11:51:08,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 11:51:08,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 11:51:08,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@775b830d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08, skipping insertion in model container [2022-04-07 11:51:08,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 11:51:08,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 11:51:08,797 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-de20.c[368,381] [2022-04-07 11:51:08,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:51:08,814 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 11:51:08,824 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-de20.c[368,381] [2022-04-07 11:51:08,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:51:08,841 INFO L208 MainTranslator]: Completed translation [2022-04-07 11:51:08,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08 WrapperNode [2022-04-07 11:51:08,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 11:51:08,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 11:51:08,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 11:51:08,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 11:51:08,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 11:51:08,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 11:51:08,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 11:51:08,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 11:51:08,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (1/1) ... [2022-04-07 11:51:08,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:51:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:08,894 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-07 11:51:08,896 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-07 11:51:08,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 11:51:08,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 11:51:08,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 11:51:08,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 11:51:08,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 11:51:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 11:51:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 11:51:08,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 11:51:08,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 11:51:08,976 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 11:51:08,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 11:51:09,076 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 11:51:09,084 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 11:51:09,085 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 11:51:09,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:51:09 BoogieIcfgContainer [2022-04-07 11:51:09,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 11:51:09,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 11:51:09,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 11:51:09,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 11:51:09,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:51:08" (1/3) ... [2022-04-07 11:51:09,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef6ac40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:51:09, skipping insertion in model container [2022-04-07 11:51:09,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:51:08" (2/3) ... [2022-04-07 11:51:09,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef6ac40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:51:09, skipping insertion in model container [2022-04-07 11:51:09,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:51:09" (3/3) ... [2022-04-07 11:51:09,098 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-04-07 11:51:09,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 11:51:09,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 11:51:09,140 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 11:51:09,146 INFO L340 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 [2022-04-07 11:51:09,146 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 11:51:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-07 11:51:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 11:51:09,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:09,193 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:09,193 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-04-07 11:51:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:09,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715376125] [2022-04-07 11:51:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:09,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:09,545 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); {24#true} is VALID [2022-04-07 11:51:09,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-07 11:51:09,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-07 11:51:09,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:09,547 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); {24#true} is VALID [2022-04-07 11:51:09,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-07 11:51:09,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-07 11:51:09,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-07 11:51:09,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:09,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:09,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:09,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:09,554 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:51:09,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:51:09,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-07 11:51:09,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-07 11:51:09,556 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-07 11:51:09,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:09,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715376125] [2022-04-07 11:51:09,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715376125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:51:09,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:51:09,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 11:51:09,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905365268] [2022-04-07 11:51:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:51:09,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 11:51:09,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:09,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:09,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:09,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 11:51:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 11:51:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 11:51:09,624 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:09,968 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-07 11:51:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:51:09,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-07 11:51:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-07 11:51:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-07 11:51:09,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-07 11:51:10,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:10,049 INFO L225 Difference]: With dead ends: 46 [2022-04-07 11:51:10,049 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 11:51:10,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 11:51:10,054 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:10,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:51:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 11:51:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-07 11:51:10,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:10,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,080 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,081 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:10,084 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 11:51:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 11:51:10,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:10,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:10,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-07 11:51:10,085 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-07 11:51:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:10,090 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 11:51:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 11:51:10,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:10,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:10,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:10,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-07 11:51:10,096 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-07 11:51:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:10,098 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-07 11:51:10,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 11:51:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 11:51:10,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:10,103 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:10,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 11:51:10,104 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:10,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-04-07 11:51:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:10,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21812593] [2022-04-07 11:51:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:10,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {165#true} is VALID [2022-04-07 11:51:10,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-07 11:51:10,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2022-04-07 11:51:10,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:10,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {165#true} is VALID [2022-04-07 11:51:10,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-07 11:51:10,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #50#return; {165#true} is VALID [2022-04-07 11:51:10,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret9 := main(); {165#true} is VALID [2022-04-07 11:51:10,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {170#(= main_~y~0 0)} is VALID [2022-04-07 11:51:10,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {170#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {170#(= main_~y~0 0)} is VALID [2022-04-07 11:51:10,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(= main_~y~0 0)} ~z~0 := ~y~0; {171#(= main_~z~0 0)} is VALID [2022-04-07 11:51:10,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#(= 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; {166#false} is VALID [2022-04-07 11:51:10,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#false} assume !(~z~0 % 4294967296 > 0); {166#false} is VALID [2022-04-07 11:51:10,173 INFO L272 TraceCheckUtils]: 10: Hoare triple {166#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {166#false} is VALID [2022-04-07 11:51:10,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#false} ~cond := #in~cond; {166#false} is VALID [2022-04-07 11:51:10,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#false} assume 0 == ~cond; {166#false} is VALID [2022-04-07 11:51:10,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-07 11:51:10,174 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-07 11:51:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21812593] [2022-04-07 11:51:10,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21812593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:51:10,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:51:10,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 11:51:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229709768] [2022-04-07 11:51:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:51:10,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 11:51:10,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:10,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:10,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 11:51:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 11:51:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 11:51:10,189 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:10,259 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 11:51:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 11:51:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 11:51:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-07 11:51:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-07 11:51:10,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-07 11:51:10,285 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-07 11:51:10,286 INFO L225 Difference]: With dead ends: 23 [2022-04-07 11:51:10,286 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 11:51:10,286 INFO L912 BasicCegarLoop]: 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-07 11:51:10,287 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:10,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 11:51:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 11:51:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 11:51:10,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:10,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,291 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,291 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:10,292 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 11:51:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 11:51:10,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:10,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:10,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 11:51:10,293 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 11:51:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:10,294 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 11:51:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 11:51:10,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:10,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:10,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:10,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 11:51:10,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-07 11:51:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:10,296 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 11:51:10,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 11:51:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 11:51:10,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:10,297 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:10,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 11:51:10,298 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-04-07 11:51:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:10,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838718875] [2022-04-07 11:51:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:10,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-07 11:51:10,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-07 11:51:10,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-07 11:51:10,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:10,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-07 11:51:10,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-07 11:51:10,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-07 11:51:10,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret9 := main(); {269#true} is VALID [2022-04-07 11:51:10,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {274#(= main_~y~0 0)} is VALID [2022-04-07 11:51:10,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:10,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:10,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {276#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:10,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {270#false} is VALID [2022-04-07 11:51:10,414 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {270#false} is VALID [2022-04-07 11:51:10,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-07 11:51:10,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-07 11:51:10,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-07 11:51:10,414 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-07 11:51:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:10,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838718875] [2022-04-07 11:51:10,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838718875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:10,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047198493] [2022-04-07 11:51:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:10,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:10,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:10,417 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-07 11:51:10,422 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-07 11:51:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:10,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 11:51:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:10,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:10,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-07 11:51:10,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-07 11:51:10,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-07 11:51:10,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-07 11:51:10,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret9 := main(); {269#true} is VALID [2022-04-07 11:51:10,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {274#(= main_~y~0 0)} is VALID [2022-04-07 11:51:10,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:10,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:10,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {305#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:10,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {270#false} is VALID [2022-04-07 11:51:10,704 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {270#false} is VALID [2022-04-07 11:51:10,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-07 11:51:10,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-07 11:51:10,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-07 11:51:10,705 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-07 11:51:10,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:10,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-07 11:51:10,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-07 11:51:10,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-07 11:51:10,787 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {270#false} is VALID [2022-04-07 11:51:10,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {270#false} is VALID [2022-04-07 11:51:10,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {333#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:51:10,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {337#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:51:10,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#(< 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; {337#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:51:10,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {344#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:51:10,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret9 := main(); {269#true} is VALID [2022-04-07 11:51:10,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #50#return; {269#true} is VALID [2022-04-07 11:51:10,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-07 11:51:10,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-07 11:51:10,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-07 11:51:10,795 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-07 11:51:10,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047198493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:10,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:10,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-07 11:51:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107102349] [2022-04-07 11:51:10,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 14 [2022-04-07 11:51:10,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:10,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-07 11:51:10,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:10,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 11:51:10,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 11:51:10,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 11:51:10,828 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-07 11:51:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:11,154 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-07 11:51:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 11:51:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 14 [2022-04-07 11:51:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-07 11:51:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-07 11:51:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-07 11:51:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-07 11:51:11,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-07 11:51:11,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:11,208 INFO L225 Difference]: With dead ends: 35 [2022-04-07 11:51:11,208 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 11:51:11,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-04-07 11:51:11,212 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:11,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 39 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:51:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 11:51:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2022-04-07 11:51:11,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:11,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:11,234 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:11,234 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:11,242 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-07 11:51:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-07 11:51:11,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:11,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:11,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-07 11:51:11,244 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-07 11:51:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:11,246 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-07 11:51:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-04-07 11:51:11,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:11,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:11,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:11,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-07 11:51:11,253 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-04-07 11:51:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:11,254 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-07 11:51:11,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-07 11:51:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-07 11:51:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 11:51:11,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:11,256 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:11,273 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-07 11:51:11,459 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:11,460 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-04-07 11:51:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:11,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807058378] [2022-04-07 11:51:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:11,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:11,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-07 11:51:11,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-07 11:51:11,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-07 11:51:11,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:11,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-07 11:51:11,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-07 11:51:11,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-07 11:51:11,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2022-04-07 11:51:11,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:11,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(= 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; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:11,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:11,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:11,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#(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; {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:11,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:11,689 INFO L272 TraceCheckUtils]: 11: Hoare triple {537#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ 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)); {538#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:51:11,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {538#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {539#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:51:11,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {539#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {531#false} is VALID [2022-04-07 11:51:11,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-07 11:51:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:11,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807058378] [2022-04-07 11:51:11,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807058378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:11,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929880546] [2022-04-07 11:51:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:11,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:11,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:11,693 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-07 11:51:11,694 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-07 11:51:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:11,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 11:51:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:11,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:11,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2022-04-07 11:51:11,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-07 11:51:11,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-07 11:51:11,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-07 11:51:11,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2022-04-07 11:51:11,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:11,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {535#(= 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; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:11,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:11,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {536#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:11,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#(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; {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:11,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:11,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {535#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:11,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:11,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {531#false} is VALID [2022-04-07 11:51:11,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-07 11:51:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:11,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:11,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {531#false} assume !false; {531#false} is VALID [2022-04-07 11:51:11,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {531#false} is VALID [2022-04-07 11:51:11,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:11,970 INFO L272 TraceCheckUtils]: 11: Hoare triple {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:11,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:11,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#(= (mod main_~n~0 4294967296) (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; {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:11,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:11,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:11,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {604#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:11,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {597#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:11,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} call #t~ret9 := main(); {530#true} is VALID [2022-04-07 11:51:11,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} #50#return; {530#true} is VALID [2022-04-07 11:51:11,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume true; {530#true} is VALID [2022-04-07 11:51:11,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {530#true} is VALID [2022-04-07 11:51:11,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} call ULTIMATE.init(); {530#true} is VALID [2022-04-07 11:51:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:11,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929880546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:11,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:11,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-07 11:51:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983029198] [2022-04-07 11:51:11,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 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 15 [2022-04-07 11:51:11,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:11,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 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-07 11:51:12,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:12,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 11:51:12,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 11:51:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-07 11:51:12,016 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 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-07 11:51:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:12,327 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-07 11:51:12,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:51:12,327 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 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 15 [2022-04-07 11:51:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 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-07 11:51:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-07 11:51:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 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-07 11:51:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-07 11:51:12,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-07 11:51:12,354 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-07 11:51:12,355 INFO L225 Difference]: With dead ends: 28 [2022-04-07 11:51:12,355 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 11:51:12,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-07 11:51:12,357 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:12,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 53 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:51:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 11:51:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-07 11:51:12,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:12,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:12,382 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:12,382 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:12,383 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-07 11:51:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-07 11:51:12,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:12,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:12,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 11:51:12,384 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 11:51:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:12,385 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-07 11:51:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-07 11:51:12,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:12,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:12,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:12,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-07 11:51:12,387 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-07 11:51:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:12,387 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-07 11:51:12,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 4 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-07 11:51:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-07 11:51:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 11:51:12,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:12,388 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:12,413 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-07 11:51:12,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 11:51:12,604 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 2 times [2022-04-07 11:51:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:12,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149897469] [2022-04-07 11:51:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:12,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-07 11:51:12,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-07 11:51:12,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-07 11:51:12,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:12,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-07 11:51:12,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-07 11:51:12,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-07 11:51:12,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret9 := main(); {769#true} is VALID [2022-04-07 11:51:12,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {774#(= main_~y~0 0)} is VALID [2022-04-07 11:51:12,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:12,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:12,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {776#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:12,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#(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; {777#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:12,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {777#(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; {770#false} is VALID [2022-04-07 11:51:12,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#false} assume !(~z~0 % 4294967296 > 0); {770#false} is VALID [2022-04-07 11:51:12,752 INFO L272 TraceCheckUtils]: 12: Hoare triple {770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-07 11:51:12,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-07 11:51:12,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-07 11:51:12,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-07 11:51:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:12,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149897469] [2022-04-07 11:51:12,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149897469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:12,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249872674] [2022-04-07 11:51:12,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:51:12,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:12,755 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-07 11:51:12,765 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-07 11:51:12,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:51:12,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:12,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 11:51:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:12,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:13,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-07 11:51:13,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-07 11:51:13,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-07 11:51:13,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-07 11:51:13,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret9 := main(); {769#true} is VALID [2022-04-07 11:51:13,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {774#(= main_~y~0 0)} is VALID [2022-04-07 11:51:13,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:13,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:13,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {776#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:13,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#(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; {777#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:13,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {777#(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; {812#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:51:13,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {812#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {770#false} is VALID [2022-04-07 11:51:13,032 INFO L272 TraceCheckUtils]: 12: Hoare triple {770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-07 11:51:13,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-07 11:51:13,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-07 11:51:13,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-07 11:51:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:13,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:13,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-07 11:51:13,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {770#false} assume 0 == ~cond; {770#false} is VALID [2022-04-07 11:51:13,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#false} ~cond := #in~cond; {770#false} is VALID [2022-04-07 11:51:13,147 INFO L272 TraceCheckUtils]: 12: Hoare triple {770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {770#false} is VALID [2022-04-07 11:51:13,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {840#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {770#false} is VALID [2022-04-07 11:51:13,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#(< 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; {840#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:51:13,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#(< 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; {844#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:13,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {848#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:13,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:13,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {859#(< 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; {852#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:13,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {859#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:13,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret9 := main(); {769#true} is VALID [2022-04-07 11:51:13,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #50#return; {769#true} is VALID [2022-04-07 11:51:13,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-07 11:51:13,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {769#true} is VALID [2022-04-07 11:51:13,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-07 11:51:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:13,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249872674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:13,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:13,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-07 11:51:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702200031] [2022-04-07 11:51:13,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:13,153 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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 16 [2022-04-07 11:51:13,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:13,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-07 11:51:13,178 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-07 11:51:13,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 11:51:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 11:51:13,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-07 11:51:13,179 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-07 11:51:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:13,800 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-07 11:51:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 11:51:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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 16 [2022-04-07 11:51:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-07 11:51:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-07 11:51:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-07 11:51:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 47 transitions. [2022-04-07 11:51:13,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 47 transitions. [2022-04-07 11:51:13,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:13,853 INFO L225 Difference]: With dead ends: 38 [2022-04-07 11:51:13,853 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 11:51:13,854 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2022-04-07 11:51:13,855 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:13,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 46 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:51:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 11:51:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-04-07 11:51:13,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:13,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:13,893 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:13,893 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:13,894 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 11:51:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 11:51:13,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:13,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:13,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-07 11:51:13,896 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-07 11:51:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:13,900 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 11:51:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 11:51:13,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:13,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:13,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:13,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-07 11:51:13,902 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-04-07 11:51:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:13,902 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-07 11:51:13,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-07 11:51:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-07 11:51:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 11:51:13,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:13,903 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:13,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 11:51:14,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:14,104 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:14,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1016701897, now seen corresponding path program 3 times [2022-04-07 11:51:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:14,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956505269] [2022-04-07 11:51:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:14,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-07 11:51:14,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-07 11:51:14,251 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-07 11:51:14,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:14,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-07 11:51:14,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-07 11:51:14,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-07 11:51:14,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret9 := main(); {1070#true} is VALID [2022-04-07 11:51:14,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:14,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(= 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; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:14,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:14,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:14,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:14,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(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; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:14,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#(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; {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:14,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:14,261 INFO L272 TraceCheckUtils]: 13: Hoare triple {1078#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ 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)); {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:51:14,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1080#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:51:14,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {1080#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1071#false} is VALID [2022-04-07 11:51:14,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-07 11:51:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956505269] [2022-04-07 11:51:14,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956505269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484429644] [2022-04-07 11:51:14,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:51:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:14,264 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-07 11:51:14,294 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-07 11:51:14,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 11:51:14,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:14,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 11:51:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:14,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:14,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-07 11:51:14,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-07 11:51:14,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-07 11:51:14,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-07 11:51:14,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret9 := main(); {1070#true} is VALID [2022-04-07 11:51:14,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:14,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(= 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; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:14,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:14,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:14,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {1077#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:14,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(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; {1076#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:14,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#(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; {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:14,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:14,448 INFO L272 TraceCheckUtils]: 13: Hoare triple {1075#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:14,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:14,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {1128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1071#false} is VALID [2022-04-07 11:51:14,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-07 11:51:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:14,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:14,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {1071#false} assume !false; {1071#false} is VALID [2022-04-07 11:51:14,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {1128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1071#false} is VALID [2022-04-07 11:51:14,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:14,580 INFO L272 TraceCheckUtils]: 13: Hoare triple {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:14,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:14,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {1151#(= (mod main_~n~0 4294967296) (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; {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:14,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {1155#(= (mod main_~n~0 4294967296) (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; {1151#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:14,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:14,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:14,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1151#(= (mod main_~n~0 4294967296) (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; {1155#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:14,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1151#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:14,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {1070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1144#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:14,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {1070#true} call #t~ret9 := main(); {1070#true} is VALID [2022-04-07 11:51:14,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1070#true} {1070#true} #50#return; {1070#true} is VALID [2022-04-07 11:51:14,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {1070#true} assume true; {1070#true} is VALID [2022-04-07 11:51:14,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1070#true} is VALID [2022-04-07 11:51:14,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {1070#true} call ULTIMATE.init(); {1070#true} is VALID [2022-04-07 11:51:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:14,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484429644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:14,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:14,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-04-07 11:51:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058058687] [2022-04-07 11:51:14,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:14,586 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 11:51:14,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:14,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 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-07 11:51:14,613 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-07 11:51:14,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 11:51:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:14,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 11:51:14,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-07 11:51:14,614 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 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-07 11:51:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:14,919 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-07 11:51:14,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:51:14,920 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 11:51:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 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-07 11:51:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-07 11:51:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 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-07 11:51:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-07 11:51:14,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2022-04-07 11:51:14,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:14,950 INFO L225 Difference]: With dead ends: 31 [2022-04-07 11:51:14,950 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 11:51:14,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-04-07 11:51:14,951 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:14,952 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 43 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:51:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 11:51:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-07 11:51:15,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:15,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:15,019 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:15,019 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:15,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:15,022 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 11:51:15,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-07 11:51:15,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:15,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:15,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states 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-07 11:51:15,026 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states 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-07 11:51:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:15,027 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-07 11:51:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-07 11:51:15,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:15,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:15,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:15,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-07 11:51:15,029 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2022-04-07 11:51:15,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:15,029 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-07 11:51:15,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 4 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-07 11:51:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-07 11:51:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 11:51:15,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:15,030 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:15,055 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-07 11:51:15,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:15,243 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:15,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1601169482, now seen corresponding path program 4 times [2022-04-07 11:51:15,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:15,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143238491] [2022-04-07 11:51:15,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:15,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:15,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-07 11:51:15,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-07 11:51:15,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-07 11:51:15,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:15,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-07 11:51:15,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-07 11:51:15,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-07 11:51:15,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret9 := main(); {1343#true} is VALID [2022-04-07 11:51:15,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1348#(= main_~y~0 0)} is VALID [2022-04-07 11:51:15,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:15,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:15,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:15,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:15,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1352#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:15,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#(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; {1353#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:15,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {1353#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1344#false} is VALID [2022-04-07 11:51:15,385 INFO L272 TraceCheckUtils]: 13: Hoare triple {1344#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1344#false} is VALID [2022-04-07 11:51:15,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2022-04-07 11:51:15,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2022-04-07 11:51:15,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-07 11:51:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:15,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:15,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143238491] [2022-04-07 11:51:15,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143238491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:15,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562623224] [2022-04-07 11:51:15,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 11:51:15,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:15,396 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-07 11:51:15,416 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-07 11:51:15,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 11:51:15,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:15,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 11:51:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:15,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:15,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-07 11:51:15,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-07 11:51:15,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-07 11:51:15,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-07 11:51:15,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret9 := main(); {1343#true} is VALID [2022-04-07 11:51:15,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1348#(= main_~y~0 0)} is VALID [2022-04-07 11:51:15,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {1348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:15,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {1349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:15,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {1350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:15,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:15,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {1351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1352#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:15,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {1352#(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; {1391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:15,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {1391#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1344#false} is VALID [2022-04-07 11:51:15,658 INFO L272 TraceCheckUtils]: 13: Hoare triple {1344#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1344#false} is VALID [2022-04-07 11:51:15,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2022-04-07 11:51:15,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2022-04-07 11:51:15,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-07 11:51:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:15,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:15,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-07 11:51:15,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2022-04-07 11:51:15,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2022-04-07 11:51:15,799 INFO L272 TraceCheckUtils]: 13: Hoare triple {1344#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1344#false} is VALID [2022-04-07 11:51:15,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1419#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1344#false} is VALID [2022-04-07 11:51:15,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#(< 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; {1419#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:51:15,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {1423#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:15,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:15,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {1434#(< 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; {1427#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:15,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#(< 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; {1434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:51:15,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#(< 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; {1438#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:51:15,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1442#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:51:15,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret9 := main(); {1343#true} is VALID [2022-04-07 11:51:15,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #50#return; {1343#true} is VALID [2022-04-07 11:51:15,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-07 11:51:15,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-07 11:51:15,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-07 11:51:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:15,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562623224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:15,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:15,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-07 11:51:15,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426972400] [2022-04-07 11:51:15,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-07 11:51:15,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:15,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-07 11:51:15,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:15,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 11:51:15,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:15,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 11:51:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-07 11:51:15,831 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-07 11:51:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:17,106 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-07 11:51:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-07 11:51:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-07 11:51:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-07 11:51:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-07 11:51:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-07 11:51:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 79 transitions. [2022-04-07 11:51:17,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 79 transitions. [2022-04-07 11:51:17,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:17,203 INFO L225 Difference]: With dead ends: 59 [2022-04-07 11:51:17,203 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 11:51:17,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=1372, Unknown=0, NotChecked=0, Total=1806 [2022-04-07 11:51:17,204 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 100 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:17,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 47 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:51:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 11:51:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 29. [2022-04-07 11:51:17,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:17,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:17,269 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:17,269 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:17,271 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-07 11:51:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-07 11:51:17,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:17,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:17,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-07 11:51:17,271 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-07 11:51:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:17,273 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-07 11:51:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-07 11:51:17,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:17,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:17,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:17,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-07 11:51:17,274 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 17 [2022-04-07 11:51:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:17,275 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-07 11:51:17,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-07 11:51:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-07 11:51:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 11:51:17,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:17,275 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:17,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 11:51:17,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:17,487 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:17,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:17,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1418492661, now seen corresponding path program 5 times [2022-04-07 11:51:17,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:17,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260158700] [2022-04-07 11:51:17,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:17,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-07 11:51:17,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-07 11:51:17,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-07 11:51:17,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:17,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-07 11:51:17,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-07 11:51:17,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-07 11:51:17,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2022-04-07 11:51:17,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1782#(= main_~y~0 0)} is VALID [2022-04-07 11:51:17,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1782#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:17,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:17,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:17,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:17,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(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; {1786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:17,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(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; {1787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:17,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(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; {1778#false} is VALID [2022-04-07 11:51:17,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {1778#false} assume !(~z~0 % 4294967296 > 0); {1778#false} is VALID [2022-04-07 11:51:17,606 INFO L272 TraceCheckUtils]: 14: Hoare triple {1778#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1778#false} is VALID [2022-04-07 11:51:17,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2022-04-07 11:51:17,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#false} assume 0 == ~cond; {1778#false} is VALID [2022-04-07 11:51:17,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2022-04-07 11:51:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:17,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260158700] [2022-04-07 11:51:17,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260158700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:17,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687717635] [2022-04-07 11:51:17,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 11:51:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:17,608 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-07 11:51:17,625 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-07 11:51:17,664 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-07 11:51:17,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 11:51:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:17,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:17,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2022-04-07 11:51:17,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-07 11:51:17,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-07 11:51:17,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-07 11:51:17,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2022-04-07 11:51:17,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1782#(= main_~y~0 0)} is VALID [2022-04-07 11:51:17,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {1782#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:17,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1783#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:17,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:17,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {1784#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1785#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:17,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(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; {1786#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:17,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(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; {1787#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:17,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(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; {1828#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:51:17,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1778#false} is VALID [2022-04-07 11:51:17,873 INFO L272 TraceCheckUtils]: 14: Hoare triple {1778#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1778#false} is VALID [2022-04-07 11:51:17,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2022-04-07 11:51:17,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#false} assume 0 == ~cond; {1778#false} is VALID [2022-04-07 11:51:17,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2022-04-07 11:51:17,873 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-07 11:51:17,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:18,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {1778#false} assume !false; {1778#false} is VALID [2022-04-07 11:51:18,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#false} assume 0 == ~cond; {1778#false} is VALID [2022-04-07 11:51:18,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#false} ~cond := #in~cond; {1778#false} is VALID [2022-04-07 11:51:18,034 INFO L272 TraceCheckUtils]: 14: Hoare triple {1778#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1778#false} is VALID [2022-04-07 11:51:18,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {1856#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1778#false} is VALID [2022-04-07 11:51:18,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {1860#(< 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; {1856#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:51:18,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1864#(< 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; {1860#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:18,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {1868#(< 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; {1864#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:18,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {1868#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:18,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:18,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {1879#(< 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; {1872#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:18,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {1883#(< 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; {1879#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:18,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {1777#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1883#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:18,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1777#true} call #t~ret9 := main(); {1777#true} is VALID [2022-04-07 11:51:18,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1777#true} {1777#true} #50#return; {1777#true} is VALID [2022-04-07 11:51:18,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1777#true} assume true; {1777#true} is VALID [2022-04-07 11:51:18,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1777#true} is VALID [2022-04-07 11:51:18,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1777#true} call ULTIMATE.init(); {1777#true} is VALID [2022-04-07 11:51:18,041 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-07 11:51:18,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687717635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:18,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:18,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-04-07 11:51:18,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741380941] [2022-04-07 11:51:18,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 18 [2022-04-07 11:51:18,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:18,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-07 11:51:18,068 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-07 11:51:18,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-07 11:51:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:18,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-07 11:51:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-07 11:51:18,069 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-07 11:51:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:19,665 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-07 11:51:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-07 11:51:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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 18 [2022-04-07 11:51:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-07 11:51:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 62 transitions. [2022-04-07 11:51:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-07 11:51:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 62 transitions. [2022-04-07 11:51:19,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 62 transitions. [2022-04-07 11:51:19,731 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-07 11:51:19,732 INFO L225 Difference]: With dead ends: 57 [2022-04-07 11:51:19,732 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 11:51:19,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2022-04-07 11:51:19,734 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:19,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 74 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 11:51:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 11:51:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-04-07 11:51:19,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:19,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:19,851 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:19,852 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:19,856 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-07 11:51:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-07 11:51:19,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:19,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:19,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-07 11:51:19,857 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-07 11:51:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:19,859 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-07 11:51:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-07 11:51:19,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:19,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:19,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:19,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-07 11:51:19,860 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 18 [2022-04-07 11:51:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:19,861 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-07 11:51:19,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 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-07 11:51:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-07 11:51:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 11:51:19,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:19,861 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:19,882 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-07 11:51:20,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:20,071 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -21737866, now seen corresponding path program 6 times [2022-04-07 11:51:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:20,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265850944] [2022-04-07 11:51:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:20,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:20,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {2214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-07 11:51:20,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-07 11:51:20,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-07 11:51:20,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:20,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-07 11:51:20,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-07 11:51:20,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-07 11:51:20,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret9 := main(); {2202#true} is VALID [2022-04-07 11:51:20,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:20,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {2207#(= 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; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:20,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:20,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:20,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:20,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:20,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {2210#(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; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:20,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {2209#(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; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:20,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {2208#(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; {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:20,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:20,257 INFO L272 TraceCheckUtils]: 15: Hoare triple {2211#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ 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)); {2212#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:51:20,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {2212#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2213#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:51:20,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {2213#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2203#false} is VALID [2022-04-07 11:51:20,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-07 11:51:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:20,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:20,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265850944] [2022-04-07 11:51:20,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265850944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:20,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871248312] [2022-04-07 11:51:20,259 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 11:51:20,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:20,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:20,260 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-07 11:51:20,261 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-07 11:51:20,297 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-07 11:51:20,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:20,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 11:51:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:20,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:20,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2202#true} is VALID [2022-04-07 11:51:20,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-07 11:51:20,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-07 11:51:20,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-07 11:51:20,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret9 := main(); {2202#true} is VALID [2022-04-07 11:51:20,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:20,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {2207#(= 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; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:20,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:20,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:20,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:20,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {2210#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:20,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {2210#(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; {2209#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:20,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {2209#(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; {2208#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:20,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {2208#(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; {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:20,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:20,455 INFO L272 TraceCheckUtils]: 15: Hoare triple {2207#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:20,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2267#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:20,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {2267#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2203#false} is VALID [2022-04-07 11:51:20,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-07 11:51:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:20,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:20,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#false} assume !false; {2203#false} is VALID [2022-04-07 11:51:20,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {2267#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2203#false} is VALID [2022-04-07 11:51:20,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2267#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:20,614 INFO L272 TraceCheckUtils]: 15: Hoare triple {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2263#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:20,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:20,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {2290#(= (mod main_~n~0 4294967296) (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; {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:20,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {2294#(= (mod main_~n~0 4294967296) (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; {2290#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:20,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2294#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:20,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} ~z~0 := ~y~0; {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:51:20,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:51:20,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {2294#(= (mod main_~n~0 4294967296) (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; {2298#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:51:20,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {2290#(= (mod main_~n~0 4294967296) (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; {2294#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:20,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2290#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:20,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2202#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2283#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:20,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {2202#true} call #t~ret9 := main(); {2202#true} is VALID [2022-04-07 11:51:20,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2202#true} {2202#true} #50#return; {2202#true} is VALID [2022-04-07 11:51:20,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {2202#true} assume true; {2202#true} is VALID [2022-04-07 11:51:20,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2202#true} is VALID [2022-04-07 11:51:20,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {2202#true} call ULTIMATE.init(); {2202#true} is VALID [2022-04-07 11:51:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:20,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871248312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:20,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:20,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-07 11:51:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387924520] [2022-04-07 11:51:20,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:20,623 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 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 19 [2022-04-07 11:51:20,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:20,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 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-07 11:51:20,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:20,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 11:51:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 11:51:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-04-07 11:51:20,661 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 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-07 11:51:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:21,230 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-07 11:51:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 11:51:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 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 19 [2022-04-07 11:51:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 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-07 11:51:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-07 11:51:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 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-07 11:51:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-07 11:51:21,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-07 11:51:21,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:21,262 INFO L225 Difference]: With dead ends: 43 [2022-04-07 11:51:21,262 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 11:51:21,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-04-07 11:51:21,263 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:21,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 63 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:51:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 11:51:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-04-07 11:51:21,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:21,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:21,360 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:21,360 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:21,361 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-07 11:51:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-07 11:51:21,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:21,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:21,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-07 11:51:21,362 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-07 11:51:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:21,363 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-07 11:51:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-07 11:51:21,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:21,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:21,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:21,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-07 11:51:21,365 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 19 [2022-04-07 11:51:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:21,365 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-07 11:51:21,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 4 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-07 11:51:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-07 11:51:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 11:51:21,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:21,366 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:21,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-07 11:51:21,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:21,575 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:21,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -639378772, now seen corresponding path program 7 times [2022-04-07 11:51:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:21,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696681075] [2022-04-07 11:51:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:21,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:21,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {2563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-07 11:51:21,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-07 11:51:21,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-07 11:51:21,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:21,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {2563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-07 11:51:21,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-07 11:51:21,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-07 11:51:21,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret9 := main(); {2550#true} is VALID [2022-04-07 11:51:21,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2555#(= main_~y~0 0)} is VALID [2022-04-07 11:51:21,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {2555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:21,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:21,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:21,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:21,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2559#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:21,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#(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; {2560#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:21,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(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; {2561#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:21,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {2561#(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; {2562#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:21,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {2562#(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; {2551#false} is VALID [2022-04-07 11:51:21,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#false} assume !(~z~0 % 4294967296 > 0); {2551#false} is VALID [2022-04-07 11:51:21,720 INFO L272 TraceCheckUtils]: 16: Hoare triple {2551#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2551#false} is VALID [2022-04-07 11:51:21,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2022-04-07 11:51:21,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {2551#false} assume 0 == ~cond; {2551#false} is VALID [2022-04-07 11:51:21,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-07 11:51:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696681075] [2022-04-07 11:51:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696681075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457015981] [2022-04-07 11:51:21,721 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 11:51:21,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:21,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:21,736 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-07 11:51:21,738 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-07 11:51:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:21,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 11:51:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:21,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:22,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-07 11:51:22,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-07 11:51:22,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-07 11:51:22,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-07 11:51:22,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret9 := main(); {2550#true} is VALID [2022-04-07 11:51:22,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2555#(= main_~y~0 0)} is VALID [2022-04-07 11:51:22,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {2555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:22,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:22,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:22,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:22,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {2558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2559#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:22,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#(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; {2560#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:22,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {2560#(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; {2561#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:22,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {2561#(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; {2562#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:22,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {2562#(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; {2551#false} is VALID [2022-04-07 11:51:22,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#false} assume !(~z~0 % 4294967296 > 0); {2551#false} is VALID [2022-04-07 11:51:22,009 INFO L272 TraceCheckUtils]: 16: Hoare triple {2551#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2551#false} is VALID [2022-04-07 11:51:22,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2022-04-07 11:51:22,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {2551#false} assume 0 == ~cond; {2551#false} is VALID [2022-04-07 11:51:22,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-07 11:51:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:22,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:22,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-07 11:51:22,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {2551#false} assume 0 == ~cond; {2551#false} is VALID [2022-04-07 11:51:22,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2022-04-07 11:51:22,181 INFO L272 TraceCheckUtils]: 16: Hoare triple {2551#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2551#false} is VALID [2022-04-07 11:51:22,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {2551#false} assume !(~z~0 % 4294967296 > 0); {2551#false} is VALID [2022-04-07 11:51:22,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {2639#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2551#false} is VALID [2022-04-07 11:51:22,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {2643#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2639#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-07 11:51:22,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {2647#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2643#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:51:22,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {2651#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2647#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-07 11:51:22,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {2651#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:51:22,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:51:22,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {2662#(not (< 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; {2655#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:51:22,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {2666#(not (< 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; {2662#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-07 11:51:22,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {2670#(not (< 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; {2666#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:51:22,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2670#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:51:22,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret9 := main(); {2550#true} is VALID [2022-04-07 11:51:22,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #50#return; {2550#true} is VALID [2022-04-07 11:51:22,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-07 11:51:22,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2550#true} is VALID [2022-04-07 11:51:22,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-07 11:51:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:22,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457015981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:22,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:22,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-07 11:51:22,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514903377] [2022-04-07 11:51:22,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:22,187 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-07 11:51:22,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:22,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-07 11:51:22,211 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-07 11:51:22,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 11:51:22,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 11:51:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-04-07 11:51:22,212 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-07 11:51:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:22,866 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 11:51:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 11:51:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-07 11:51:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-07 11:51:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-07 11:51:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-07 11:51:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2022-04-07 11:51:22,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2022-04-07 11:51:22,901 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-07 11:51:22,901 INFO L225 Difference]: With dead ends: 44 [2022-04-07 11:51:22,901 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 11:51:22,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-04-07 11:51:22,902 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:22,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:51:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 11:51:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 11:51:23,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:23,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 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-07 11:51:23,011 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 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-07 11:51:23,011 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 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-07 11:51:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:23,013 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 11:51:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 11:51:23,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:23,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:23,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 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 33 states. [2022-04-07 11:51:23,013 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 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 33 states. [2022-04-07 11:51:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:23,014 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-07 11:51:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 11:51:23,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:23,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:23,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:23,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:23,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 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-07 11:51:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-07 11:51:23,015 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-04-07 11:51:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:23,015 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-07 11:51:23,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 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-07 11:51:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-07 11:51:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 11:51:23,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:23,016 INFO L499 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:23,041 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-07 11:51:23,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 11:51:23,227 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash -610638132, now seen corresponding path program 8 times [2022-04-07 11:51:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:23,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733019721] [2022-04-07 11:51:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:23,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-07 11:51:23,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-07 11:51:23,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-07 11:51:23,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:23,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-07 11:51:23,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-07 11:51:23,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-07 11:51:23,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret9 := main(); {2905#true} is VALID [2022-04-07 11:51:23,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {2905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2910#(= main_~y~0 0)} is VALID [2022-04-07 11:51:23,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:23,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:23,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:23,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:23,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:23,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:23,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:51:23,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {2916#(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; {2917#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:23,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {2917#(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; {2918#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 11:51:23,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {2918#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2906#false} is VALID [2022-04-07 11:51:23,393 INFO L272 TraceCheckUtils]: 16: Hoare triple {2906#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2906#false} is VALID [2022-04-07 11:51:23,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2022-04-07 11:51:23,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {2906#false} assume 0 == ~cond; {2906#false} is VALID [2022-04-07 11:51:23,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2022-04-07 11:51:23,393 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-07 11:51:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:23,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733019721] [2022-04-07 11:51:23,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733019721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:23,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430889871] [2022-04-07 11:51:23,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:51:23,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:23,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:23,395 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-07 11:51:23,420 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-07 11:51:23,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:51:23,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:23,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 11:51:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:23,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:23,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2905#true} is VALID [2022-04-07 11:51:23,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {2905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-07 11:51:23,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-07 11:51:23,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-07 11:51:23,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret9 := main(); {2905#true} is VALID [2022-04-07 11:51:23,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {2905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2910#(= main_~y~0 0)} is VALID [2022-04-07 11:51:23,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {2910#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:23,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {2911#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:23,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2912#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:23,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {2913#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:23,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {2914#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:23,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:23,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2916#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:51:23,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {2916#(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; {2917#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:23,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {2917#(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; {2965#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:23,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2906#false} is VALID [2022-04-07 11:51:23,662 INFO L272 TraceCheckUtils]: 16: Hoare triple {2906#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2906#false} is VALID [2022-04-07 11:51:23,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2022-04-07 11:51:23,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {2906#false} assume 0 == ~cond; {2906#false} is VALID [2022-04-07 11:51:23,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2022-04-07 11:51:23,662 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-07 11:51:23,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:23,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {2906#false} assume !false; {2906#false} is VALID [2022-04-07 11:51:23,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {2906#false} assume 0 == ~cond; {2906#false} is VALID [2022-04-07 11:51:23,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#false} ~cond := #in~cond; {2906#false} is VALID [2022-04-07 11:51:23,879 INFO L272 TraceCheckUtils]: 16: Hoare triple {2906#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2906#false} is VALID [2022-04-07 11:51:23,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {2993#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2906#false} is VALID [2022-04-07 11:51:23,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {2997#(< 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; {2993#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:51:23,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {3001#(< 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; {2997#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:23,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {3001#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:23,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:23,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {3012#(< 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; {3005#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:23,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {3016#(< 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; {3012#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:23,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {3020#(< 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; {3016#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:51:23,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#(< 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; {3020#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:51:23,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {3028#(< 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; {3024#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:51:23,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {2905#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3028#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:51:23,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {2905#true} call #t~ret9 := main(); {2905#true} is VALID [2022-04-07 11:51:23,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2905#true} {2905#true} #50#return; {2905#true} is VALID [2022-04-07 11:51:23,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {2905#true} assume true; {2905#true} is VALID [2022-04-07 11:51:23,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {2905#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2905#true} is VALID [2022-04-07 11:51:23,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {2905#true} call ULTIMATE.init(); {2905#true} is VALID [2022-04-07 11:51:23,888 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-07 11:51:23,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430889871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:23,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:23,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-07 11:51:23,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485568962] [2022-04-07 11:51:23,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:23,889 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-07 11:51:23,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:23,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-07 11:51:23,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:23,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 11:51:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 11:51:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-07 11:51:23,919 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-07 11:51:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:28,468 INFO L93 Difference]: Finished difference Result 82 states and 115 transitions. [2022-04-07 11:51:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-07 11:51:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-07 11:51:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-07 11:51:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 115 transitions. [2022-04-07 11:51:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-07 11:51:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 115 transitions. [2022-04-07 11:51:28,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 115 transitions. [2022-04-07 11:51:28,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:28,626 INFO L225 Difference]: With dead ends: 82 [2022-04-07 11:51:28,626 INFO L226 Difference]: Without dead ends: 77 [2022-04-07 11:51:28,627 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1065, Invalid=3627, Unknown=0, NotChecked=0, Total=4692 [2022-04-07 11:51:28,628 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 142 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:28,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 77 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 11:51:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-07 11:51:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 39. [2022-04-07 11:51:28,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:28,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:28,764 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:28,764 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:28,766 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-07 11:51:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-07 11:51:28,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:28,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:28,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-07 11:51:28,767 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-07 11:51:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:28,768 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-07 11:51:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-07 11:51:28,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:28,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:28,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:28,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-04-07 11:51:28,770 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 20 [2022-04-07 11:51:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:28,770 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-04-07 11:51:28,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 states have internal predecessors, (30), 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-07 11:51:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-04-07 11:51:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 11:51:28,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:28,771 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:28,791 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-07 11:51:28,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:28,986 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:28,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1612182871, now seen corresponding path program 9 times [2022-04-07 11:51:28,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:28,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236211404] [2022-04-07 11:51:28,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:29,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {3524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-07 11:51:29,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-07 11:51:29,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-07 11:51:29,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {3511#true} call ULTIMATE.init(); {3524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:29,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {3524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-07 11:51:29,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-07 11:51:29,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-07 11:51:29,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {3511#true} call #t~ret9 := main(); {3511#true} is VALID [2022-04-07 11:51:29,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {3511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:29,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {3516#(= 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; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:29,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:29,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:29,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#(and (<= (+ 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; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:29,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:29,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:29,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {3520#(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; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:29,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {3519#(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; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:29,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {3518#(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; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:29,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#(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; {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:29,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:29,182 INFO L272 TraceCheckUtils]: 17: Hoare triple {3521#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ 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)); {3522#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:51:29,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {3522#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3523#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:51:29,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {3523#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3512#false} is VALID [2022-04-07 11:51:29,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#false} assume !false; {3512#false} is VALID [2022-04-07 11:51:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:29,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:29,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236211404] [2022-04-07 11:51:29,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236211404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:29,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271075126] [2022-04-07 11:51:29,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:51:29,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:29,185 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-07 11:51:29,199 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-07 11:51:29,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-07 11:51:29,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:29,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 11:51:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:29,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:29,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {3511#true} call ULTIMATE.init(); {3511#true} is VALID [2022-04-07 11:51:29,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {3511#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-07 11:51:29,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-07 11:51:29,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-07 11:51:29,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {3511#true} call #t~ret9 := main(); {3511#true} is VALID [2022-04-07 11:51:29,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {3511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:29,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {3516#(= 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; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:29,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:29,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:29,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {3519#(and (<= (+ 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; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:29,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:29,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {3520#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:29,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {3520#(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; {3519#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:29,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {3519#(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; {3518#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:29,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {3518#(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; {3517#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:29,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#(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; {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:29,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:29,386 INFO L272 TraceCheckUtils]: 17: Hoare triple {3516#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:29,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:29,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {3583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3512#false} is VALID [2022-04-07 11:51:29,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#false} assume !false; {3512#false} is VALID [2022-04-07 11:51:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:29,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:29,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {3512#false} assume !false; {3512#false} is VALID [2022-04-07 11:51:29,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {3583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3512#false} is VALID [2022-04-07 11:51:29,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:29,563 INFO L272 TraceCheckUtils]: 17: Hoare triple {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:29,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:29,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {3606#(= (mod main_~n~0 4294967296) (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; {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:29,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {3610#(= (mod main_~n~0 4294967296) (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; {3606#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:29,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3610#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:29,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {3618#(= (mod main_~n~0 4294967296) (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; {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:51:29,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:51:29,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:51:29,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3618#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:51:29,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {3610#(= (mod main_~n~0 4294967296) (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; {3614#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:51:29,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {3606#(= (mod main_~n~0 4294967296) (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; {3610#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:29,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3606#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:29,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {3511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3599#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:29,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {3511#true} call #t~ret9 := main(); {3511#true} is VALID [2022-04-07 11:51:29,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3511#true} {3511#true} #50#return; {3511#true} is VALID [2022-04-07 11:51:29,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {3511#true} assume true; {3511#true} is VALID [2022-04-07 11:51:29,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {3511#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3511#true} is VALID [2022-04-07 11:51:29,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {3511#true} call ULTIMATE.init(); {3511#true} is VALID [2022-04-07 11:51:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:29,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271075126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:29,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:29,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-04-07 11:51:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485384645] [2022-04-07 11:51:29,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 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-07 11:51:29,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:29,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 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-07 11:51:29,610 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-07 11:51:29,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 11:51:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:29,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 11:51:29,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-04-07 11:51:29,611 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 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-07 11:51:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:30,306 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-07 11:51:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 11:51:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 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-07 11:51:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 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-07 11:51:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-07 11:51:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 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-07 11:51:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-07 11:51:30,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-07 11:51:30,338 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-07 11:51:30,339 INFO L225 Difference]: With dead ends: 49 [2022-04-07 11:51:30,339 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 11:51:30,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-04-07 11:51:30,340 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:30,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:51:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 11:51:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-04-07 11:51:30,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:30,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:30,492 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:30,492 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:30,493 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-07 11:51:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-07 11:51:30,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:30,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:30,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-07 11:51:30,493 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-07 11:51:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:30,494 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-07 11:51:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-07 11:51:30,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:30,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:30,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:30,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-04-07 11:51:30,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 21 [2022-04-07 11:51:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:30,496 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-04-07 11:51:30,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 4 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-07 11:51:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-04-07 11:51:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 11:51:30,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:30,496 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:30,520 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-07 11:51:30,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 11:51:30,697 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:30,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:30,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1527443477, now seen corresponding path program 10 times [2022-04-07 11:51:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:30,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289214473] [2022-04-07 11:51:30,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:30,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {3924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-07 11:51:30,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-07 11:51:30,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-07 11:51:30,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {3909#true} call ULTIMATE.init(); {3924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:30,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {3924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-07 11:51:30,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-07 11:51:30,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-07 11:51:30,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {3909#true} call #t~ret9 := main(); {3909#true} is VALID [2022-04-07 11:51:30,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {3909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3914#(= main_~y~0 0)} is VALID [2022-04-07 11:51:30,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {3914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:30,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:30,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:30,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:30,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:30,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3919#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:30,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {3919#(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; {3920#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:30,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {3920#(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; {3921#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:30,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {3921#(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; {3922#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:30,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {3922#(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; {3923#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:30,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {3923#(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; {3910#false} is VALID [2022-04-07 11:51:30,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {3910#false} assume !(~z~0 % 4294967296 > 0); {3910#false} is VALID [2022-04-07 11:51:30,872 INFO L272 TraceCheckUtils]: 18: Hoare triple {3910#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3910#false} is VALID [2022-04-07 11:51:30,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {3910#false} ~cond := #in~cond; {3910#false} is VALID [2022-04-07 11:51:30,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {3910#false} assume 0 == ~cond; {3910#false} is VALID [2022-04-07 11:51:30,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {3910#false} assume !false; {3910#false} is VALID [2022-04-07 11:51:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:30,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:30,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289214473] [2022-04-07 11:51:30,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289214473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:30,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553765757] [2022-04-07 11:51:30,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 11:51:30,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:30,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:30,875 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-07 11:51:30,875 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-07 11:51:30,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 11:51:30,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:30,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 11:51:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:30,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:31,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {3909#true} call ULTIMATE.init(); {3909#true} is VALID [2022-04-07 11:51:31,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {3909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-07 11:51:31,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-07 11:51:31,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-07 11:51:31,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {3909#true} call #t~ret9 := main(); {3909#true} is VALID [2022-04-07 11:51:31,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {3909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3914#(= main_~y~0 0)} is VALID [2022-04-07 11:51:31,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {3914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:31,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {3915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:31,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {3916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:31,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {3917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:31,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:31,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {3918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3919#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:31,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {3919#(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; {3920#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:31,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {3920#(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; {3921#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:51:31,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {3921#(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; {3922#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:51:31,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {3922#(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; {3923#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:51:31,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {3923#(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; {3910#false} is VALID [2022-04-07 11:51:31,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {3910#false} assume !(~z~0 % 4294967296 > 0); {3910#false} is VALID [2022-04-07 11:51:31,165 INFO L272 TraceCheckUtils]: 18: Hoare triple {3910#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3910#false} is VALID [2022-04-07 11:51:31,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {3910#false} ~cond := #in~cond; {3910#false} is VALID [2022-04-07 11:51:31,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {3910#false} assume 0 == ~cond; {3910#false} is VALID [2022-04-07 11:51:31,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {3910#false} assume !false; {3910#false} is VALID [2022-04-07 11:51:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:31,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:31,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {3910#false} assume !false; {3910#false} is VALID [2022-04-07 11:51:31,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {3910#false} assume 0 == ~cond; {3910#false} is VALID [2022-04-07 11:51:31,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {3910#false} ~cond := #in~cond; {3910#false} is VALID [2022-04-07 11:51:31,421 INFO L272 TraceCheckUtils]: 18: Hoare triple {3910#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3910#false} is VALID [2022-04-07 11:51:31,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {3910#false} assume !(~z~0 % 4294967296 > 0); {3910#false} is VALID [2022-04-07 11:51:31,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {4006#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3910#false} is VALID [2022-04-07 11:51:31,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {4010#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4006#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-07 11:51:31,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {4014#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4010#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:51:31,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {4018#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4014#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-07 11:51:31,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4018#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:51:31,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} ~z~0 := ~y~0; {4022#(not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-07 11:51:31,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 11:51:31,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {4033#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4026#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-07 11:51:31,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {4037#(not (< 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; {4033#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-07 11:51:31,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {4041#(not (< 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; {4037#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-07 11:51:31,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {4045#(not (< 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; {4041#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-07 11:51:31,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {3909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4045#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-07 11:51:31,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {3909#true} call #t~ret9 := main(); {3909#true} is VALID [2022-04-07 11:51:31,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3909#true} {3909#true} #50#return; {3909#true} is VALID [2022-04-07 11:51:31,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {3909#true} assume true; {3909#true} is VALID [2022-04-07 11:51:31,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3909#true} is VALID [2022-04-07 11:51:31,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {3909#true} call ULTIMATE.init(); {3909#true} is VALID [2022-04-07 11:51:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:31,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553765757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:31,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:31,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-07 11:51:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94299209] [2022-04-07 11:51:31,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-07 11:51:31,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:31,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-07 11:51:31,455 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-07 11:51:31,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-07 11:51:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-07 11:51:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-04-07 11:51:31,456 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-07 11:51:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:32,167 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 11:51:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 11:51:32,168 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-07 11:51:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-07 11:51:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2022-04-07 11:51:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-07 11:51:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 33 transitions. [2022-04-07 11:51:32,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 33 transitions. [2022-04-07 11:51:32,200 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-07 11:51:32,200 INFO L225 Difference]: With dead ends: 50 [2022-04-07 11:51:32,200 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 11:51:32,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 11:51:32,201 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:32,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:51:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 11:51:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-07 11:51:32,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:32,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:32,340 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:32,340 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:32,341 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-04-07 11:51:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 11:51:32,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:32,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:32,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-07 11:51:32,341 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-07 11:51:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:32,342 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-04-07 11:51:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 11:51:32,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:32,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:32,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:32,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-07 11:51:32,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 22 [2022-04-07 11:51:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:32,344 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-07 11:51:32,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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-07 11:51:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 11:51:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 11:51:32,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:32,344 INFO L499 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:32,364 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-07 11:51:32,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 11:51:32,559 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash -636483637, now seen corresponding path program 11 times [2022-04-07 11:51:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:32,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564056790] [2022-04-07 11:51:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:32,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {4332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-07 11:51:32,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-07 11:51:32,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-07 11:51:32,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} call ULTIMATE.init(); {4332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:32,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {4332#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-07 11:51:32,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-07 11:51:32,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-07 11:51:32,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} call #t~ret9 := main(); {4316#true} is VALID [2022-04-07 11:51:32,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4321#(= main_~y~0 0)} is VALID [2022-04-07 11:51:32,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {4321#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:32,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:32,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:32,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:32,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:32,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:51:32,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:51:32,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {4328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:51:32,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {4328#(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; {4329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:51:32,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {4329#(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; {4330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:32,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {4330#(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; {4331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 11:51:32,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {4331#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4317#false} is VALID [2022-04-07 11:51:32,726 INFO L272 TraceCheckUtils]: 18: Hoare triple {4317#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4317#false} is VALID [2022-04-07 11:51:32,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} ~cond := #in~cond; {4317#false} is VALID [2022-04-07 11:51:32,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} assume 0 == ~cond; {4317#false} is VALID [2022-04-07 11:51:32,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} assume !false; {4317#false} is VALID [2022-04-07 11:51:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:32,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:32,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564056790] [2022-04-07 11:51:32,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564056790] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:32,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674012850] [2022-04-07 11:51:32,727 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 11:51:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:32,729 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-07 11:51:32,730 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-07 11:51:32,772 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-07 11:51:32,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:32,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 11:51:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:32,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:33,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} call ULTIMATE.init(); {4316#true} is VALID [2022-04-07 11:51:33,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-07 11:51:33,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-07 11:51:33,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-07 11:51:33,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} call #t~ret9 := main(); {4316#true} is VALID [2022-04-07 11:51:33,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4321#(= main_~y~0 0)} is VALID [2022-04-07 11:51:33,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {4321#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:33,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {4322#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:33,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {4323#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:33,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {4324#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:33,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {4325#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:33,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {4326#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:51:33,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:51:33,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {4327#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {4328#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:51:33,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {4328#(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; {4329#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:51:33,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {4329#(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; {4330#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:33,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {4330#(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; {4384#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:33,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {4384#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4317#false} is VALID [2022-04-07 11:51:33,007 INFO L272 TraceCheckUtils]: 18: Hoare triple {4317#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4317#false} is VALID [2022-04-07 11:51:33,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} ~cond := #in~cond; {4317#false} is VALID [2022-04-07 11:51:33,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} assume 0 == ~cond; {4317#false} is VALID [2022-04-07 11:51:33,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} assume !false; {4317#false} is VALID [2022-04-07 11:51:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:33,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:33,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {4317#false} assume !false; {4317#false} is VALID [2022-04-07 11:51:33,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#false} assume 0 == ~cond; {4317#false} is VALID [2022-04-07 11:51:33,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {4317#false} ~cond := #in~cond; {4317#false} is VALID [2022-04-07 11:51:33,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {4317#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4317#false} is VALID [2022-04-07 11:51:33,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {4412#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4317#false} is VALID [2022-04-07 11:51:33,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {4416#(< 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; {4412#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:51:33,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {4420#(< 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; {4416#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:33,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {4424#(< 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; {4420#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:33,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {4424#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:33,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:33,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {4435#(< 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; {4428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:33,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {4439#(< 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; {4435#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:33,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {4443#(< 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; {4439#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:33,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {4447#(< 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; {4443#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:51:33,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {4451#(< 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; {4447#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:51:33,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {4455#(< 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; {4451#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:51:33,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {4316#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4455#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:51:33,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {4316#true} call #t~ret9 := main(); {4316#true} is VALID [2022-04-07 11:51:33,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4316#true} {4316#true} #50#return; {4316#true} is VALID [2022-04-07 11:51:33,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {4316#true} assume true; {4316#true} is VALID [2022-04-07 11:51:33,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {4316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4316#true} is VALID [2022-04-07 11:51:33,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {4316#true} call ULTIMATE.init(); {4316#true} is VALID [2022-04-07 11:51:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:33,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674012850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:33,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:33,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-07 11:51:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125023760] [2022-04-07 11:51:33,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:33,277 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-07 11:51:33,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:33,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-07 11:51:33,306 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-07 11:51:33,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 11:51:33,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:33,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 11:51:33,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-04-07 11:51:33,307 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-07 11:51:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:44,517 INFO L93 Difference]: Finished difference Result 103 states and 144 transitions. [2022-04-07 11:51:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-07 11:51:44,517 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-07 11:51:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-07 11:51:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 144 transitions. [2022-04-07 11:51:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-07 11:51:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 144 transitions. [2022-04-07 11:51:44,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 144 transitions. [2022-04-07 11:51:44,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:44,810 INFO L225 Difference]: With dead ends: 103 [2022-04-07 11:51:44,810 INFO L226 Difference]: Without dead ends: 98 [2022-04-07 11:51:44,812 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2398 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1783, Invalid=6589, Unknown=0, NotChecked=0, Total=8372 [2022-04-07 11:51:44,812 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 197 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:44,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-07 11:51:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-07 11:51:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 50. [2022-04-07 11:51:45,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:45,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-07 11:51:45,056 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-07 11:51:45,057 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-07 11:51:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:45,058 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-07 11:51:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-07 11:51:45,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:45,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:45,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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 98 states. [2022-04-07 11:51:45,059 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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 98 states. [2022-04-07 11:51:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:45,061 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2022-04-07 11:51:45,061 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-04-07 11:51:45,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:45,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:45,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:45,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 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-07 11:51:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-07 11:51:45,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 22 [2022-04-07 11:51:45,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:45,062 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-07 11:51:45,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-07 11:51:45,062 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-07 11:51:45,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 11:51:45,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:45,063 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:45,079 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-07 11:51:45,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 11:51:45,267 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1854745558, now seen corresponding path program 12 times [2022-04-07 11:51:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:45,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153012905] [2022-04-07 11:51:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:45,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {5094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-07 11:51:45,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-07 11:51:45,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-07 11:51:45,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:45,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {5094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-07 11:51:45,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-07 11:51:45,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-07 11:51:45,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret9 := main(); {5080#true} is VALID [2022-04-07 11:51:45,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:45,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {5085#(= 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; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:45,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:45,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:45,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {5088#(and (<= (+ 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; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:45,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) 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; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-07 11:51:45,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-07 11:51:45,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-07 11:51:45,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 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; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:45,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {5089#(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; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:45,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {5088#(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; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:45,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {5087#(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; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:45,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {5086#(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; {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:45,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:51:45,469 INFO L272 TraceCheckUtils]: 19: Hoare triple {5091#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ 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)); {5092#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:51:45,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {5092#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5093#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:51:45,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {5093#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5081#false} is VALID [2022-04-07 11:51:45,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-07 11:51:45,470 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-07 11:51:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:45,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153012905] [2022-04-07 11:51:45,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153012905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:45,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562866869] [2022-04-07 11:51:45,470 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 11:51:45,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:45,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:45,471 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-07 11:51:45,472 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-07 11:51:45,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-07 11:51:45,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:51:45,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-07 11:51:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:45,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:45,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2022-04-07 11:51:45,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-07 11:51:45,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-07 11:51:45,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-07 11:51:45,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret9 := main(); {5080#true} is VALID [2022-04-07 11:51:45,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:45,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {5085#(= 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; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:45,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:45,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:45,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {5088#(and (<= (+ 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; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:45,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) 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; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-07 11:51:45,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-07 11:51:45,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-07 11:51:45,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {5090#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 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; {5089#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:51:45,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {5089#(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; {5088#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-07 11:51:45,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {5088#(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; {5087#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:51:45,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {5087#(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; {5086#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:51:45,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {5086#(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; {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:45,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:51:45,718 INFO L272 TraceCheckUtils]: 19: Hoare triple {5085#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:45,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:45,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {5159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5081#false} is VALID [2022-04-07 11:51:45,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-07 11:51:45,719 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-07 11:51:45,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:45,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-07 11:51:45,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {5159#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5081#false} is VALID [2022-04-07 11:51:45,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5159#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:51:45,912 INFO L272 TraceCheckUtils]: 19: Hoare triple {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5155#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:51:45,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:45,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {5182#(= (mod main_~n~0 4294967296) (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; {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:45,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {5186#(= (mod main_~n~0 4294967296) (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; {5182#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:45,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5186#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:45,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {5194#(= (mod main_~n~0 4294967296) (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; {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:51:45,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {5198#(= (mod main_~n~0 4294967296) (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; {5194#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:51:45,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:51:45,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:51:45,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {5194#(= (mod main_~n~0 4294967296) (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; {5198#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:51:45,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5194#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:51:45,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {5186#(= (mod main_~n~0 4294967296) (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; {5190#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:51:45,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {5182#(= (mod main_~n~0 4294967296) (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; {5186#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:51:45,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5182#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:51:45,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5175#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:51:45,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret9 := main(); {5080#true} is VALID [2022-04-07 11:51:45,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #50#return; {5080#true} is VALID [2022-04-07 11:51:45,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-07 11:51:45,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-07 11:51:45,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2022-04-07 11:51:45,920 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-07 11:51:45,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562866869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:45,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:45,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-07 11:51:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481605952] [2022-04-07 11:51:45,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 11:51:45,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:45,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 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-07 11:51:45,958 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-07 11:51:45,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-07 11:51:45,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-07 11:51:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-04-07 11:51:45,959 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 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-07 11:51:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:46,796 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-04-07 11:51:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 11:51:46,796 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 11:51:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:51:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 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-07 11:51:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-07 11:51:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 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-07 11:51:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-07 11:51:46,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-07 11:51:46,837 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-07 11:51:46,837 INFO L225 Difference]: With dead ends: 61 [2022-04-07 11:51:46,837 INFO L226 Difference]: Without dead ends: 56 [2022-04-07 11:51:46,838 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2022-04-07 11:51:46,839 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 11:51:46,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 11:51:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-07 11:51:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2022-04-07 11:51:47,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:51:47,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:47,131 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:47,131 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:47,133 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-07 11:51:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-07 11:51:47,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:47,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:47,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-07 11:51:47,133 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-07 11:51:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:51:47,134 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-07 11:51:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-07 11:51:47,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:51:47,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:51:47,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:51:47,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:51:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:51:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2022-04-07 11:51:47,136 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 23 [2022-04-07 11:51:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:51:47,136 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2022-04-07 11:51:47,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 17 states have internal predecessors, (38), 4 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-07 11:51:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-04-07 11:51:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 11:51:47,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:51:47,137 INFO L499 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:51:47,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-07 11:51:47,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 11:51:47,347 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:51:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:51:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash -747983508, now seen corresponding path program 13 times [2022-04-07 11:51:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:51:47,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336339717] [2022-04-07 11:51:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:51:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:51:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:51:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:47,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {5587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-07 11:51:47,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-07 11:51:47,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-07 11:51:47,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {5569#true} call ULTIMATE.init(); {5587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:51:47,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-07 11:51:47,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-07 11:51:47,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-07 11:51:47,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {5569#true} call #t~ret9 := main(); {5569#true} is VALID [2022-04-07 11:51:47,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {5569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5574#(= main_~y~0 0)} is VALID [2022-04-07 11:51:47,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {5574#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:47,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#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#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:47,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:47,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:47,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:47,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:51:47,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:51:47,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:51:47,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {5582#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-07 11:51:47,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {5582#(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; {5583#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:51:47,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {5583#(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; {5584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:51:47,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#(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; {5585#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:47,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {5585#(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; {5586#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 11:51:47,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {5586#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5570#false} is VALID [2022-04-07 11:51:47,550 INFO L272 TraceCheckUtils]: 20: Hoare triple {5570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5570#false} is VALID [2022-04-07 11:51:47,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {5570#false} ~cond := #in~cond; {5570#false} is VALID [2022-04-07 11:51:47,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {5570#false} assume 0 == ~cond; {5570#false} is VALID [2022-04-07 11:51:47,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {5570#false} assume !false; {5570#false} is VALID [2022-04-07 11:51:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:51:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336339717] [2022-04-07 11:51:47,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336339717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:51:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528844321] [2022-04-07 11:51:47,551 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 11:51:47,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:51:47,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:51:47,552 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-07 11:51:47,552 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-07 11:51:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:47,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-07 11:51:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:51:47,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:51:47,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {5569#true} call ULTIMATE.init(); {5569#true} is VALID [2022-04-07 11:51:47,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {5569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-07 11:51:47,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-07 11:51:47,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-07 11:51:47,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {5569#true} call #t~ret9 := main(); {5569#true} is VALID [2022-04-07 11:51:47,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {5569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5574#(= main_~y~0 0)} is VALID [2022-04-07 11:51:47,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {5574#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:51:47,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {5575#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#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#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:51:47,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:51:47,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {5577#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:51:47,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {5578#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:51:47,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {5579#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:51:47,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {5580#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:51:47,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:51:47,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {5581#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {5582#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-07 11:51:47,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {5582#(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; {5583#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:51:47,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {5583#(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; {5584#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:51:47,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#(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; {5585#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:51:47,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {5585#(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; {5645#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:51:47,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {5645#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5570#false} is VALID [2022-04-07 11:51:47,851 INFO L272 TraceCheckUtils]: 20: Hoare triple {5570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5570#false} is VALID [2022-04-07 11:51:47,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {5570#false} ~cond := #in~cond; {5570#false} is VALID [2022-04-07 11:51:47,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {5570#false} assume 0 == ~cond; {5570#false} is VALID [2022-04-07 11:51:47,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {5570#false} assume !false; {5570#false} is VALID [2022-04-07 11:51:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:47,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:51:48,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {5570#false} assume !false; {5570#false} is VALID [2022-04-07 11:51:48,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {5570#false} assume 0 == ~cond; {5570#false} is VALID [2022-04-07 11:51:48,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {5570#false} ~cond := #in~cond; {5570#false} is VALID [2022-04-07 11:51:48,202 INFO L272 TraceCheckUtils]: 20: Hoare triple {5570#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5570#false} is VALID [2022-04-07 11:51:48,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {5673#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5570#false} is VALID [2022-04-07 11:51:48,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {5677#(< 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; {5673#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:51:48,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {5681#(< 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; {5677#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:48,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {5685#(< 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; {5681#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:48,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {5689#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5685#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:48,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {5689#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-07 11:51:48,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:51:48,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {5700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:51:48,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {5704#(< 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; {5700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:51:48,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {5708#(< 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; {5704#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:51:48,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {5712#(< 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; {5708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:51:48,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {5716#(< 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; {5712#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:51:48,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {5720#(< 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; {5716#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:51:48,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {5724#(< 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; {5720#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:51:48,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {5569#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5724#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:51:48,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {5569#true} call #t~ret9 := main(); {5569#true} is VALID [2022-04-07 11:51:48,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5569#true} {5569#true} #50#return; {5569#true} is VALID [2022-04-07 11:51:48,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {5569#true} assume true; {5569#true} is VALID [2022-04-07 11:51:48,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {5569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5569#true} is VALID [2022-04-07 11:51:48,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {5569#true} call ULTIMATE.init(); {5569#true} is VALID [2022-04-07 11:51:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:51:48,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528844321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:51:48,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:51:48,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-07 11:51:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998275244] [2022-04-07 11:51:48,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:51:48,214 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-07 11:51:48,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:51:48,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-07 11:51:48,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:51:48,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-07 11:51:48,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:51:48,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-07 11:51:48,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-04-07 11:51:48,261 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-07 11:52:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:16,316 INFO L93 Difference]: Finished difference Result 135 states and 188 transitions. [2022-04-07 11:52:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-04-07 11:52:16,316 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-07 11:52:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:52:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-07 11:52:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 188 transitions. [2022-04-07 11:52:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-07 11:52:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 188 transitions. [2022-04-07 11:52:16,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 188 transitions. [2022-04-07 11:52:16,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:52:16,896 INFO L225 Difference]: With dead ends: 135 [2022-04-07 11:52:16,896 INFO L226 Difference]: Without dead ends: 130 [2022-04-07 11:52:16,899 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4829 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=3140, Invalid=12112, Unknown=0, NotChecked=0, Total=15252 [2022-04-07 11:52:16,900 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 288 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-07 11:52:16,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 83 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-07 11:52:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-07 11:52:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 63. [2022-04-07 11:52:17,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:52:17,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:17,261 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:17,261 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:17,264 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-07 11:52:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-07 11:52:17,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:52:17,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:52:17,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-07 11:52:17,265 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-07 11:52:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:17,267 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2022-04-07 11:52:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2022-04-07 11:52:17,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:52:17,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:52:17,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:52:17,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:52:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2022-04-07 11:52:17,269 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 24 [2022-04-07 11:52:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:52:17,269 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2022-04-07 11:52:17,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-07 11:52:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2022-04-07 11:52:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 11:52:17,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:52:17,270 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:52:17,295 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-07 11:52:17,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:52:17,491 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:52:17,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:52:17,491 INFO L85 PathProgramCache]: Analyzing trace with hash 690452087, now seen corresponding path program 14 times [2022-04-07 11:52:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:52:17,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9498408] [2022-04-07 11:52:17,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:52:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:52:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:52:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:18,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {6576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-07 11:52:18,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-07 11:52:18,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-07 11:52:18,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {6555#true} call ULTIMATE.init(); {6576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:52:18,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {6576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-07 11:52:18,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-07 11:52:18,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-07 11:52:18,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {6555#true} call #t~ret9 := main(); {6555#true} is VALID [2022-04-07 11:52:18,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {6555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:52:18,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {6560#(= 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; {6561#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:52:18,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {6561#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6562#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:52:18,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {6562#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= 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; {6563#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-07 11:52:18,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {6563#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6564#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:52:18,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {6564#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) 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; {6565#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-07 11:52:18,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {6565#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6566#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-07 11:52:18,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {6566#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-07 11:52:18,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-07 11:52:18,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {6567#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {6568#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-07 11:52:18,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {6568#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6569#(and (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 11:52:18,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {6569#(and (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6570#(and (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 11:52:18,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {6570#(and (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 3) main_~x~0) (<= 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; {6571#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:52:18,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {6571#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= 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; {6572#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:52:18,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {6572#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= 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; {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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-07 11:52:18,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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); {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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-07 11:52:18,273 INFO L272 TraceCheckUtils]: 21: Hoare triple {6573#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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)); {6574#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:52:18,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {6574#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6575#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:52:18,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {6575#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6556#false} is VALID [2022-04-07 11:52:18,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {6556#false} assume !false; {6556#false} is VALID [2022-04-07 11:52:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:52:18,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9498408] [2022-04-07 11:52:18,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9498408] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:52:18,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971646511] [2022-04-07 11:52:18,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:52:18,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:52:18,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:52:18,281 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-07 11:52:18,282 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-07 11:52:18,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:52:18,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:52:18,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 11:52:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:18,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:52:18,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {6555#true} call ULTIMATE.init(); {6555#true} is VALID [2022-04-07 11:52:18,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {6555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-07 11:52:18,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-07 11:52:18,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-07 11:52:18,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {6555#true} call #t~ret9 := main(); {6555#true} is VALID [2022-04-07 11:52:18,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {6555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:52:18,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {6560#(= 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; {6598#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-07 11:52:18,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {6598#(= (+ 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; {6602#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-07 11:52:18,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {6602#(= 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; {6606#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:52:18,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {6606#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6610#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:52:18,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {6610#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6614#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:52:18,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {6614#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-07 11:52:18,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} assume !(~x~0 % 4294967296 > 0); {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-07 11:52:18,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} ~z~0 := ~y~0; {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-07 11:52:18,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {6618#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6614#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:52:18,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {6614#(= (+ main_~x~0 1) (+ main_~n~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; {6610#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:52:18,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {6610#(= (+ main_~n~0 (- 3)) (+ 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; {6606#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:52:18,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {6606#(= (+ (- 2) 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; {6602#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-07 11:52:18,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {6602#(= 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; {6598#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-07 11:52:18,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {6598#(= (+ 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; {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:52:18,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:52:18,602 INFO L272 TraceCheckUtils]: 21: Hoare triple {6560#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:52:18,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:52:18,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {6653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6556#false} is VALID [2022-04-07 11:52:18,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {6556#false} assume !false; {6556#false} is VALID [2022-04-07 11:52:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:18,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:52:18,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {6556#false} assume !false; {6556#false} is VALID [2022-04-07 11:52:18,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {6653#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6556#false} is VALID [2022-04-07 11:52:18,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6653#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:52:18,916 INFO L272 TraceCheckUtils]: 21: Hoare triple {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6649#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:52:18,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:52:18,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {6676#(= (mod main_~n~0 4294967296) (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; {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:52:18,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {6680#(= (mod main_~n~0 4294967296) (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; {6676#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:52:18,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6680#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:52:18,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {6688#(= (mod main_~n~0 4294967296) (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; {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:52:18,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {6692#(= (mod main_~n~0 4294967296) (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; {6688#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:52:18,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6692#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:52:18,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-07 11:52:18,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-07 11:52:18,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {6692#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6696#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-07 11:52:18,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {6688#(= (mod main_~n~0 4294967296) (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; {6692#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:52:18,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6688#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:52:18,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {6680#(= (mod main_~n~0 4294967296) (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; {6684#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:52:18,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {6676#(= (mod main_~n~0 4294967296) (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; {6680#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:52:18,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6676#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:52:18,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {6555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6669#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:52:18,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {6555#true} call #t~ret9 := main(); {6555#true} is VALID [2022-04-07 11:52:18,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6555#true} {6555#true} #50#return; {6555#true} is VALID [2022-04-07 11:52:18,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {6555#true} assume true; {6555#true} is VALID [2022-04-07 11:52:18,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {6555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6555#true} is VALID [2022-04-07 11:52:18,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {6555#true} call ULTIMATE.init(); {6555#true} is VALID [2022-04-07 11:52:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:18,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971646511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:52:18,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:52:18,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 34 [2022-04-07 11:52:18,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582859045] [2022-04-07 11:52:18,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:52:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 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 25 [2022-04-07 11:52:18,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:52:18,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 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-07 11:52:19,044 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-07 11:52:19,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-07 11:52:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:52:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-07 11:52:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2022-04-07 11:52:19,045 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 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-07 11:52:20,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:20,875 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-07 11:52:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-07 11:52:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 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 25 [2022-04-07 11:52:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:52:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 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-07 11:52:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2022-04-07 11:52:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 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-07 11:52:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2022-04-07 11:52:20,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2022-04-07 11:52:20,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:52:20,936 INFO L225 Difference]: With dead ends: 78 [2022-04-07 11:52:20,936 INFO L226 Difference]: Without dead ends: 73 [2022-04-07 11:52:20,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=209, Invalid=2143, Unknown=0, NotChecked=0, Total=2352 [2022-04-07 11:52:20,937 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 11:52:20,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 11:52:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-07 11:52:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2022-04-07 11:52:21,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:52:21,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:21,373 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:21,373 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:21,374 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2022-04-07 11:52:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2022-04-07 11:52:21,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:52:21,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:52:21,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-07 11:52:21,375 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-07 11:52:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:21,378 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2022-04-07 11:52:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2022-04-07 11:52:21,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:52:21,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:52:21,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:52:21,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:52:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-04-07 11:52:21,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 25 [2022-04-07 11:52:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:52:21,380 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-04-07 11:52:21,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 31 states have internal predecessors, (55), 4 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-07 11:52:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-04-07 11:52:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 11:52:21,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:52:21,381 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:52:21,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-07 11:52:21,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-07 11:52:21,595 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:52:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:52:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash -112387369, now seen corresponding path program 2 times [2022-04-07 11:52:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:52:21,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237147126] [2022-04-07 11:52:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:52:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:52:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:21,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:52:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:21,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {7189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-07 11:52:21,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-07 11:52:21,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-07 11:52:21,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {7170#true} call ULTIMATE.init(); {7189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:52:21,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {7189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-07 11:52:21,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-07 11:52:21,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-07 11:52:21,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {7170#true} call #t~ret9 := main(); {7170#true} is VALID [2022-04-07 11:52:21,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {7170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7175#(= main_~y~0 0)} is VALID [2022-04-07 11:52:21,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {7175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:52:21,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:52:21,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:52:21,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:52:21,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:52:21,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:52:21,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:52:21,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#(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; {7183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:52:21,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {7183#(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; {7184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:52:21,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {7184#(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; {7185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:52:21,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {7185#(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; {7186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:52:21,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {7186#(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; {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:52:21,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:52:21,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {7188#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-07 11:52:21,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {7188#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7171#false} is VALID [2022-04-07 11:52:21,837 INFO L272 TraceCheckUtils]: 21: Hoare triple {7171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7171#false} is VALID [2022-04-07 11:52:21,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {7171#false} ~cond := #in~cond; {7171#false} is VALID [2022-04-07 11:52:21,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {7171#false} assume 0 == ~cond; {7171#false} is VALID [2022-04-07 11:52:21,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {7171#false} assume !false; {7171#false} is VALID [2022-04-07 11:52:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:52:21,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237147126] [2022-04-07 11:52:21,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237147126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:52:21,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258375764] [2022-04-07 11:52:21,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:52:21,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:52:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:52:21,844 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-07 11:52:21,867 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-07 11:52:21,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:52:21,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:52:21,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 11:52:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:21,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:52:22,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {7170#true} call ULTIMATE.init(); {7170#true} is VALID [2022-04-07 11:52:22,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {7170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-07 11:52:22,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-07 11:52:22,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-07 11:52:22,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {7170#true} call #t~ret9 := main(); {7170#true} is VALID [2022-04-07 11:52:22,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {7170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7175#(= main_~y~0 0)} is VALID [2022-04-07 11:52:22,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {7175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:52:22,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {7176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:52:22,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {7177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:52:22,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {7178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:52:22,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {7179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:52:22,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {7180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:52:22,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {7181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:52:22,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#(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; {7183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:52:22,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {7183#(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; {7184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:52:22,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {7184#(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; {7185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:52:22,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {7185#(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; {7186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:52:22,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {7186#(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; {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:52:22,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:52:22,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {7187#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {7250#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-07 11:52:22,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {7250#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7171#false} is VALID [2022-04-07 11:52:22,205 INFO L272 TraceCheckUtils]: 21: Hoare triple {7171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7171#false} is VALID [2022-04-07 11:52:22,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {7171#false} ~cond := #in~cond; {7171#false} is VALID [2022-04-07 11:52:22,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {7171#false} assume 0 == ~cond; {7171#false} is VALID [2022-04-07 11:52:22,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {7171#false} assume !false; {7171#false} is VALID [2022-04-07 11:52:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:22,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:52:22,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {7171#false} assume !false; {7171#false} is VALID [2022-04-07 11:52:22,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {7171#false} assume 0 == ~cond; {7171#false} is VALID [2022-04-07 11:52:22,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {7171#false} ~cond := #in~cond; {7171#false} is VALID [2022-04-07 11:52:22,610 INFO L272 TraceCheckUtils]: 21: Hoare triple {7171#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7171#false} is VALID [2022-04-07 11:52:22,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {7278#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7171#false} is VALID [2022-04-07 11:52:22,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {7282#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7278#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:52:22,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {7282#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7282#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:52:22,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {7289#(< 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; {7282#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:52:22,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {7293#(< 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; {7289#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:52:22,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {7297#(< 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; {7293#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:52:22,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {7301#(< 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; {7297#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:52:22,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {7305#(< 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; {7301#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-07 11:52:22,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {7309#(< 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; {7305#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-07 11:52:22,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {7313#(< 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; {7309#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-07 11:52:22,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {7317#(< 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; {7313#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-07 11:52:22,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {7321#(< 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; {7317#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-07 11:52:22,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {7325#(< 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; {7321#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-07 11:52:22,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {7329#(< 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; {7325#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-07 11:52:22,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {7333#(< 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; {7329#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-07 11:52:22,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {7170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7333#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-07 11:52:22,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {7170#true} call #t~ret9 := main(); {7170#true} is VALID [2022-04-07 11:52:22,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7170#true} {7170#true} #50#return; {7170#true} is VALID [2022-04-07 11:52:22,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {7170#true} assume true; {7170#true} is VALID [2022-04-07 11:52:22,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {7170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7170#true} is VALID [2022-04-07 11:52:22,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {7170#true} call ULTIMATE.init(); {7170#true} is VALID [2022-04-07 11:52:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:22,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258375764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:52:22,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:52:22,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-07 11:52:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003603276] [2022-04-07 11:52:22,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:52:22,628 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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 25 [2022-04-07 11:52:22,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:52:22,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-07 11:52:22,657 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-07 11:52:22,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-07 11:52:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:52:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-07 11:52:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-07 11:52:22,659 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-07 11:52:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:53,625 INFO L93 Difference]: Finished difference Result 185 states and 248 transitions. [2022-04-07 11:52:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-07 11:52:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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 25 [2022-04-07 11:52:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:52:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-07 11:52:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 186 transitions. [2022-04-07 11:52:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-07 11:52:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 186 transitions. [2022-04-07 11:52:53,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 186 transitions. [2022-04-07 11:52:53,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:52:53,823 INFO L225 Difference]: With dead ends: 185 [2022-04-07 11:52:53,823 INFO L226 Difference]: Without dead ends: 180 [2022-04-07 11:52:53,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=1536, Invalid=4784, Unknown=0, NotChecked=0, Total=6320 [2022-04-07 11:52:53,825 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 613 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-07 11:52:53,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 115 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-07 11:52:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-07 11:52:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 73. [2022-04-07 11:52:54,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:52:54,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:54,357 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:54,358 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:54,361 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2022-04-07 11:52:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 230 transitions. [2022-04-07 11:52:54,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:52:54,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:52:54,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-07 11:52:54,362 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-07 11:52:54,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:52:54,365 INFO L93 Difference]: Finished difference Result 180 states and 230 transitions. [2022-04-07 11:52:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 230 transitions. [2022-04-07 11:52:54,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:52:54,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:52:54,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:52:54,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:52:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2022-04-07 11:52:54,367 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 25 [2022-04-07 11:52:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:52:54,367 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2022-04-07 11:52:54,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.25) internal successors, (40), 31 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-07 11:52:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2022-04-07 11:52:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 11:52:54,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:52:54,368 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:52:54,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 11:52:54,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 11:52:54,590 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:52:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:52:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -135474548, now seen corresponding path program 15 times [2022-04-07 11:52:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:52:54,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797383962] [2022-04-07 11:52:54,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:52:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:52:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:54,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:52:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:54,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {8299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-07 11:52:54,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-07 11:52:54,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-07 11:52:54,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:52:54,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {8299#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-07 11:52:54,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-07 11:52:54,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-07 11:52:54,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret9 := main(); {8282#true} is VALID [2022-04-07 11:52:54,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {8282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8287#(= main_~y~0 0)} is VALID [2022-04-07 11:52:54,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {8287#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:52:54,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:52:54,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:52:54,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:52:54,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:52:54,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:52:54,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:52:54,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {8293#(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; {8294#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:52:54,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {8294#(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; {8295#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:52:54,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {8295#(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; {8296#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:52:54,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {8296#(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; {8297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {8297#(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; {8298#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {8298#(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; {8283#false} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {8283#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; {8283#false} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {8283#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; {8283#false} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {8283#false} assume !(~z~0 % 4294967296 > 0); {8283#false} is VALID [2022-04-07 11:52:54,805 INFO L272 TraceCheckUtils]: 22: Hoare triple {8283#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8283#false} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#false} assume 0 == ~cond; {8283#false} is VALID [2022-04-07 11:52:54,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2022-04-07 11:52:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 11:52:54,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:52:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797383962] [2022-04-07 11:52:54,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797383962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:52:54,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688500695] [2022-04-07 11:52:54,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:52:54,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:52:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:52:54,807 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-07 11:52:54,808 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-07 11:52:54,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-07 11:52:54,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:52:54,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 11:52:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:52:54,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:52:55,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8282#true} is VALID [2022-04-07 11:52:55,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {8282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-07 11:52:55,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-07 11:52:55,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-07 11:52:55,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret9 := main(); {8282#true} is VALID [2022-04-07 11:52:55,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {8282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8287#(= main_~y~0 0)} is VALID [2022-04-07 11:52:55,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {8287#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:52:55,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:52:55,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {8289#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:52:55,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {8290#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:52:55,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {8291#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:52:55,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:52:55,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {8292#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {8293#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:52:55,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {8293#(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; {8294#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:52:55,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {8294#(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; {8295#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:52:55,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {8295#(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; {8296#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:52:55,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {8296#(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; {8297#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:52:55,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {8297#(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; {8298#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:52:55,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {8298#(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; {8357#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:52:55,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {8357#(and (<= (+ main_~z~0 1) 0) (<= 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; {8361#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} is VALID [2022-04-07 11:52:55,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {8361#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8365#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} is VALID [2022-04-07 11:52:55,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {8365#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} assume !(~z~0 % 4294967296 > 0); {8283#false} is VALID [2022-04-07 11:52:55,199 INFO L272 TraceCheckUtils]: 22: Hoare triple {8283#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8283#false} is VALID [2022-04-07 11:52:55,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2022-04-07 11:52:55,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#false} assume 0 == ~cond; {8283#false} is VALID [2022-04-07 11:52:55,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2022-04-07 11:52:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:55,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:52:55,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {8283#false} assume !false; {8283#false} is VALID [2022-04-07 11:52:55,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {8283#false} assume 0 == ~cond; {8283#false} is VALID [2022-04-07 11:52:55,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {8283#false} ~cond := #in~cond; {8283#false} is VALID [2022-04-07 11:52:55,568 INFO L272 TraceCheckUtils]: 22: Hoare triple {8283#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8283#false} is VALID [2022-04-07 11:52:55,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {8393#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8283#false} is VALID [2022-04-07 11:52:55,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {8397#(< 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; {8393#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:52:55,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {8401#(< 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; {8397#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:52:55,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {8405#(< 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; {8401#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:52:55,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {8409#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8405#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-07 11:52:55,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {8413#(< 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; {8409#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-07 11:52:55,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {8417#(< 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; {8413#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-07 11:52:55,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {8421#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8417#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-07 11:52:55,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {8425#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8421#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-07 11:52:55,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {8425#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-07 11:52:55,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-07 11:52:55,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {8436#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8429#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-07 11:52:55,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {8440#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8436#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-07 11:52:55,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {8444#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8440#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-07 11:52:55,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {8448#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8444#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 11:52:55,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {8452#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8448#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:52:55,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {8282#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8452#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:52:55,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {8282#true} call #t~ret9 := main(); {8282#true} is VALID [2022-04-07 11:52:55,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8282#true} {8282#true} #50#return; {8282#true} is VALID [2022-04-07 11:52:55,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {8282#true} assume true; {8282#true} is VALID [2022-04-07 11:52:55,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {8282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8282#true} is VALID [2022-04-07 11:52:55,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {8282#true} call ULTIMATE.init(); {8282#true} is VALID [2022-04-07 11:52:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:52:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688500695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:52:55,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:52:55,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 33 [2022-04-07 11:52:55,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078910633] [2022-04-07 11:52:55,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:52:55,581 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-07 11:52:55,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:52:55,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:52:55,614 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-07 11:52:55,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-07 11:52:55,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:52:55,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-07 11:52:55,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2022-04-07 11:52:55,615 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:53:23,008 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2022-04-07 11:53:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-07 11:53:23,008 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-07 11:53:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:53:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 140 transitions. [2022-04-07 11:53:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 140 transitions. [2022-04-07 11:53:23,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 140 transitions. [2022-04-07 11:53:23,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:53:23,516 INFO L225 Difference]: With dead ends: 146 [2022-04-07 11:53:23,516 INFO L226 Difference]: Without dead ends: 131 [2022-04-07 11:53:23,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3028 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=1479, Invalid=10731, Unknown=0, NotChecked=0, Total=12210 [2022-04-07 11:53:23,519 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 118 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-07 11:53:23,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 111 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-07 11:53:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-07 11:53:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2022-04-07 11:53:24,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:53:24,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:24,460 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:24,460 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:53:24,463 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2022-04-07 11:53:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2022-04-07 11:53:24,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:53:24,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:53:24,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-07 11:53:24,464 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 131 states. [2022-04-07 11:53:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:53:24,466 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2022-04-07 11:53:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2022-04-07 11:53:24,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:53:24,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:53:24,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:53:24,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:53:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2022-04-07 11:53:24,468 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 26 [2022-04-07 11:53:24,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:53:24,468 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2022-04-07 11:53:24,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-04-07 11:53:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 11:53:24,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:53:24,469 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:53:24,491 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-07 11:53:24,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:53:24,691 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:53:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:53:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash -992485066, now seen corresponding path program 16 times [2022-04-07 11:53:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:53:24,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581924664] [2022-04-07 11:53:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:53:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:53:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:53:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:53:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:53:25,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {9344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-07 11:53:25,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-07 11:53:25,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-07 11:53:25,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:53:25,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {9344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-07 11:53:25,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-07 11:53:25,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-07 11:53:25,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret9 := main(); {9321#true} is VALID [2022-04-07 11:53:25,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:53:25,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {9326#(= 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; {9327#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:53:25,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {9327#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9328#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:53:25,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {9328#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= 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; {9329#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-07 11:53:25,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {9329#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9330#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:53:25,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {9330#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) 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; {9331#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-07 11:53:25,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {9331#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9332#(and (<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-07 11:53:25,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {9332#(and (<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) 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; {9333#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-07 11:53:25,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {9333#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-07 11:53:25,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} ~z~0 := ~y~0; {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-07 11:53:25,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {9334#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 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; {9335#(and (<= (+ (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-07 11:53:25,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {9335#(and (<= (+ (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~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; {9336#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 main_~x~0)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} is VALID [2022-04-07 11:53:25,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {9336#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 main_~x~0)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9337#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 11:53:25,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {9337#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 3) main_~x~0) (<= 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; {9338#(and (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-07 11:53:25,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {9338#(and (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 4) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9339#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:53:25,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {9339#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) 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; {9340#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:53:25,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {9340#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) 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; {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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-07 11:53:25,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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); {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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-07 11:53:25,399 INFO L272 TraceCheckUtils]: 23: Hoare triple {9341#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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)); {9342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:53:25,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {9342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:53:25,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {9343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9322#false} is VALID [2022-04-07 11:53:25,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-07 11:53:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:53:25,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:53:25,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581924664] [2022-04-07 11:53:25,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581924664] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:53:25,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765755902] [2022-04-07 11:53:25,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 11:53:25,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:53:25,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:53:25,402 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-07 11:53:25,403 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-07 11:53:25,441 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 11:53:25,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:53:25,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 11:53:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:53:25,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:53:25,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2022-04-07 11:53:25,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-07 11:53:25,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-07 11:53:25,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-07 11:53:25,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret9 := main(); {9321#true} is VALID [2022-04-07 11:53:25,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:53:25,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {9326#(= 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; {9366#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-07 11:53:25,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {9366#(= (+ 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; {9370#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-07 11:53:25,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {9370#(= (+ 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; {9374#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:53:25,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {9374#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9378#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:53:25,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {9378#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9382#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-07 11:53:25,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {9382#(= (+ main_~n~0 (- 3)) (+ 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; {9386#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-07 11:53:25,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {9386#(= (+ main_~n~0 (- 3)) (+ 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; {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-07 11:53:25,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} assume !(~x~0 % 4294967296 > 0); {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-07 11:53:25,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} ~z~0 := ~y~0; {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-07 11:53:25,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {9390#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {9386#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-07 11:53:25,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {9386#(= (+ main_~n~0 (- 3)) (+ 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; {9382#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-07 11:53:25,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {9382#(= (+ main_~n~0 (- 3)) (+ 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; {9378#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:53:25,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {9378#(= (+ main_~n~0 (- 3)) (+ 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; {9374#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:53:25,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {9374#(= (+ (- 2) 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; {9370#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-07 11:53:25,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {9370#(= (+ 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; {9366#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-07 11:53:25,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {9366#(= (+ 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; {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:53:25,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:53:25,746 INFO L272 TraceCheckUtils]: 23: Hoare triple {9326#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:53:25,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:53:25,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {9428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9322#false} is VALID [2022-04-07 11:53:25,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-07 11:53:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:53:25,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:53:26,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {9322#false} assume !false; {9322#false} is VALID [2022-04-07 11:53:26,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {9428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9322#false} is VALID [2022-04-07 11:53:26,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:53:26,139 INFO L272 TraceCheckUtils]: 23: Hoare triple {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:53:26,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:53:26,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {9451#(= (mod main_~n~0 4294967296) (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; {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:53:26,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {9455#(= (mod main_~n~0 4294967296) (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; {9451#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:53:26,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9455#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:53:26,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {9463#(= (mod main_~n~0 4294967296) (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; {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:53:26,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {9467#(= (mod main_~n~0 4294967296) (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; {9463#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:53:26,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9467#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:53:26,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-07 11:53:26,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-07 11:53:26,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-07 11:53:26,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9475#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-07 11:53:26,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {9467#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9471#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-07 11:53:26,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {9463#(= (mod main_~n~0 4294967296) (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; {9467#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:53:26,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9463#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:53:26,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {9455#(= (mod main_~n~0 4294967296) (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; {9459#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:53:26,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {9451#(= (mod main_~n~0 4294967296) (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; {9455#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:53:26,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9451#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:53:26,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {9321#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9444#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:53:26,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {9321#true} call #t~ret9 := main(); {9321#true} is VALID [2022-04-07 11:53:26,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9321#true} {9321#true} #50#return; {9321#true} is VALID [2022-04-07 11:53:26,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {9321#true} assume true; {9321#true} is VALID [2022-04-07 11:53:26,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {9321#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9321#true} is VALID [2022-04-07 11:53:26,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {9321#true} call ULTIMATE.init(); {9321#true} is VALID [2022-04-07 11:53:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:53:26,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765755902] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:53:26,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:53:26,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 38 [2022-04-07 11:53:26,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357731096] [2022-04-07 11:53:26,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:53:26,153 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 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 27 [2022-04-07 11:53:26,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:53:26,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 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-07 11:53:26,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:53:26,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-07 11:53:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:53:26,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-07 11:53:26,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2022-04-07 11:53:26,227 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 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-07 11:53:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:53:31,474 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2022-04-07 11:53:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 11:53:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 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 27 [2022-04-07 11:53:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:53:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 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-07 11:53:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2022-04-07 11:53:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 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-07 11:53:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2022-04-07 11:53:31,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2022-04-07 11:53:31,555 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-07 11:53:31,556 INFO L225 Difference]: With dead ends: 100 [2022-04-07 11:53:31,556 INFO L226 Difference]: Without dead ends: 95 [2022-04-07 11:53:31,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=237, Invalid=2733, Unknown=0, NotChecked=0, Total=2970 [2022-04-07 11:53:31,557 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 11:53:31,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 104 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 11:53:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-07 11:53:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2022-04-07 11:53:32,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:53:32,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:32,461 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:32,461 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:53:32,462 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2022-04-07 11:53:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-07 11:53:32,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:53:32,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:53:32,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-07 11:53:32,462 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-07 11:53:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:53:32,464 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2022-04-07 11:53:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2022-04-07 11:53:32,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:53:32,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:53:32,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:53:32,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:53:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:53:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2022-04-07 11:53:32,467 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 27 [2022-04-07 11:53:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:53:32,467 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2022-04-07 11:53:32,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 35 states have internal predecessors, (61), 4 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-07 11:53:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2022-04-07 11:53:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 11:53:32,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:53:32,468 INFO L499 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:53:32,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-07 11:53:32,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:53:32,668 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:53:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:53:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 521429270, now seen corresponding path program 17 times [2022-04-07 11:53:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:53:32,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043977239] [2022-04-07 11:53:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:53:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:53:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:53:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:53:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:53:32,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {10095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-07 11:53:32,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-07 11:53:32,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-07 11:53:32,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {10074#true} call ULTIMATE.init(); {10095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:53:32,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {10095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-07 11:53:32,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-07 11:53:32,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-07 11:53:32,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {10074#true} call #t~ret9 := main(); {10074#true} is VALID [2022-04-07 11:53:32,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {10074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10079#(= main_~y~0 0)} is VALID [2022-04-07 11:53:32,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {10079#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:53:32,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:53:32,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:53:32,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:53:32,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:53:32,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:53:32,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:53:32,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {10086#(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; {10087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:53:32,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {10087#(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; {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:53:32,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:53:32,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-07 11:53:32,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-07 11:53:32,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10091#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-07 11:53:32,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {10091#(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; {10092#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:53:32,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {10092#(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; {10093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:53:32,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(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; {10094#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-07 11:53:32,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {10094#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10075#false} is VALID [2022-04-07 11:53:32,948 INFO L272 TraceCheckUtils]: 23: Hoare triple {10075#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10075#false} is VALID [2022-04-07 11:53:32,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {10075#false} ~cond := #in~cond; {10075#false} is VALID [2022-04-07 11:53:32,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {10075#false} assume 0 == ~cond; {10075#false} is VALID [2022-04-07 11:53:32,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {10075#false} assume !false; {10075#false} is VALID [2022-04-07 11:53:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:53:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:53:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043977239] [2022-04-07 11:53:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043977239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:53:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737212626] [2022-04-07 11:53:32,949 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 11:53:32,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:53:32,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:53:32,952 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-07 11:53:32,962 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-07 11:53:33,144 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-07 11:53:33,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:53:33,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 11:53:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:53:33,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:53:33,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {10074#true} call ULTIMATE.init(); {10074#true} is VALID [2022-04-07 11:53:33,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {10074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-07 11:53:33,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-07 11:53:33,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-07 11:53:33,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {10074#true} call #t~ret9 := main(); {10074#true} is VALID [2022-04-07 11:53:33,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {10074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10079#(= main_~y~0 0)} is VALID [2022-04-07 11:53:33,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {10079#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:53:33,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {10080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:53:33,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {10081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:53:33,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {10082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:53:33,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {10083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:53:33,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {10084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:53:33,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {10085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10086#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:53:33,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {10086#(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; {10087#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:53:33,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {10087#(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; {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:53:33,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:53:33,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {10088#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-07 11:53:33,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {10089#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-07 11:53:33,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {10090#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10091#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-07 11:53:33,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {10091#(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; {10092#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:53:33,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {10092#(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; {10093#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:53:33,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {10093#(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; {10162#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:53:33,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {10162#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {10075#false} is VALID [2022-04-07 11:53:33,435 INFO L272 TraceCheckUtils]: 23: Hoare triple {10075#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10075#false} is VALID [2022-04-07 11:53:33,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {10075#false} ~cond := #in~cond; {10075#false} is VALID [2022-04-07 11:53:33,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {10075#false} assume 0 == ~cond; {10075#false} is VALID [2022-04-07 11:53:33,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {10075#false} assume !false; {10075#false} is VALID [2022-04-07 11:53:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:53:33,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:53:33,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {10075#false} assume !false; {10075#false} is VALID [2022-04-07 11:53:33,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {10075#false} assume 0 == ~cond; {10075#false} is VALID [2022-04-07 11:53:33,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {10075#false} ~cond := #in~cond; {10075#false} is VALID [2022-04-07 11:53:33,866 INFO L272 TraceCheckUtils]: 23: Hoare triple {10075#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10075#false} is VALID [2022-04-07 11:53:33,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {10190#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10075#false} is VALID [2022-04-07 11:53:33,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {10194#(< 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; {10190#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:53:33,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {10198#(< 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; {10194#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:53:33,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {10202#(< 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; {10198#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:53:33,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {10206#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10202#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-07 11:53:33,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {10210#(< 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; {10206#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-07 11:53:33,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {10210#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-07 11:53:33,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 11:53:33,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {10221#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10214#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 11:53:33,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {10225#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10221#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:53:33,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {10229#(< 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; {10225#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:53:33,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {10233#(< 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; {10229#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-07 11:53:33,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {10237#(< 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; {10233#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:53:33,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {10241#(< 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; {10237#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:53:33,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {10245#(< 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; {10241#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:53:33,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {10249#(< 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; {10245#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:53:33,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {10253#(< 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; {10249#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:53:33,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {10074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10253#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-07 11:53:33,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {10074#true} call #t~ret9 := main(); {10074#true} is VALID [2022-04-07 11:53:33,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10074#true} {10074#true} #50#return; {10074#true} is VALID [2022-04-07 11:53:33,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {10074#true} assume true; {10074#true} is VALID [2022-04-07 11:53:33,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {10074#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10074#true} is VALID [2022-04-07 11:53:33,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {10074#true} call ULTIMATE.init(); {10074#true} is VALID [2022-04-07 11:53:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:53:33,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737212626] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:53:33,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:53:33,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-07 11:53:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976930576] [2022-04-07 11:53:33,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:53:33,877 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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-07 11:53:33,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:53:33,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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-07 11:53:33,911 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-07 11:53:33,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-07 11:53:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:53:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-07 11:53:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-07 11:53:33,912 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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-07 11:53:45,876 WARN L232 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 11:53:57,154 WARN L232 SmtUtils]: Spent 5.07s 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-07 11:54:06,845 WARN L232 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 11:55:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:33,740 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2022-04-07 11:55:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2022-04-07 11:55:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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-07 11:55:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:55:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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-07 11:55:33,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 250 transitions. [2022-04-07 11:55:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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-07 11:55:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 250 transitions. [2022-04-07 11:55:33,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 250 transitions. [2022-04-07 11:55:36,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:55:36,053 INFO L225 Difference]: With dead ends: 197 [2022-04-07 11:55:36,053 INFO L226 Difference]: Without dead ends: 192 [2022-04-07 11:55:36,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10108 ImplicationChecksByTransitivity, 112.0s TimeCoverageRelationStatistics Valid=6000, Invalid=23411, Unknown=1, NotChecked=0, Total=29412 [2022-04-07 11:55:36,056 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 365 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 11:55:36,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 101 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 11:55:36,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-07 11:55:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 91. [2022-04-07 11:55:37,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:55:37,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:55:37,204 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:55:37,204 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:55:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:37,207 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-07 11:55:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2022-04-07 11:55:37,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:37,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:37,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-07 11:55:37,208 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 192 states. [2022-04-07 11:55:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:55:37,211 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2022-04-07 11:55:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2022-04-07 11:55:37,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:55:37,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:55:37,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:55:37,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:55:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:55:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-04-07 11:55:37,214 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 27 [2022-04-07 11:55:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:55:37,214 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-04-07 11:55:37,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 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-07 11:55:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2022-04-07 11:55:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 11:55:37,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:55:37,215 INFO L499 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:55:37,225 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-07 11:55:37,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:37,420 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:55:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:55:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash 553613387, now seen corresponding path program 18 times [2022-04-07 11:55:37,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:55:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601183709] [2022-04-07 11:55:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:55:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:55:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:37,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:55:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:37,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {11483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-07 11:55:37,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-07 11:55:37,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-07 11:55:37,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {11464#true} call ULTIMATE.init(); {11483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:55:37,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {11483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-07 11:55:37,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-07 11:55:37,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-07 11:55:37,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {11464#true} call #t~ret9 := main(); {11464#true} is VALID [2022-04-07 11:55:37,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {11464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11469#(= main_~y~0 0)} is VALID [2022-04-07 11:55:37,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {11469#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:37,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:37,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:37,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:55:37,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:55:37,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:37,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:37,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {11476#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:55:37,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {11476#(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; {11477#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:55:37,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {11477#(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; {11478#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:55:37,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {11478#(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; {11479#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:55:37,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {11479#(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; {11480#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:55:37,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {11480#(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; {11481#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:55:37,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {11481#(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; {11482#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:55:37,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {11482#(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; {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {11465#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; {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {11465#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; {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {11465#false} assume !(~z~0 % 4294967296 > 0); {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L272 TraceCheckUtils]: 24: Hoare triple {11465#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {11465#false} ~cond := #in~cond; {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {11465#false} assume 0 == ~cond; {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {11465#false} assume !false; {11465#false} is VALID [2022-04-07 11:55:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 11:55:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:55:37,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601183709] [2022-04-07 11:55:37,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601183709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:55:37,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085253990] [2022-04-07 11:55:37,673 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 11:55:37,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:55:37,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:55:37,675 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-07 11:55:37,680 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-07 11:55:37,754 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-07 11:55:37,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:55:37,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 11:55:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:55:37,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:55:38,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {11464#true} call ULTIMATE.init(); {11464#true} is VALID [2022-04-07 11:55:38,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-07 11:55:38,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-07 11:55:38,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-07 11:55:38,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {11464#true} call #t~ret9 := main(); {11464#true} is VALID [2022-04-07 11:55:38,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {11464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11469#(= main_~y~0 0)} is VALID [2022-04-07 11:55:38,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {11469#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:55:38,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {11470#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:55:38,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {11471#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:55:38,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {11472#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:55:38,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {11473#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:55:38,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {11474#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:38,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:55:38,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {11475#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {11476#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:55:38,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {11476#(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; {11477#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:55:38,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {11477#(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; {11478#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:55:38,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {11478#(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; {11479#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:55:38,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {11479#(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; {11480#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:55:38,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {11480#(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; {11481#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:55:38,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {11481#(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; {11482#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:55:38,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {11482#(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; {11547#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:55:38,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {11547#(and (<= (+ main_~z~0 1) 0) (<= 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; {11551#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} is VALID [2022-04-07 11:55:38,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {11551#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11555#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} is VALID [2022-04-07 11:55:38,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {11555#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} assume !(~z~0 % 4294967296 > 0); {11465#false} is VALID [2022-04-07 11:55:38,059 INFO L272 TraceCheckUtils]: 24: Hoare triple {11465#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11465#false} is VALID [2022-04-07 11:55:38,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {11465#false} ~cond := #in~cond; {11465#false} is VALID [2022-04-07 11:55:38,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {11465#false} assume 0 == ~cond; {11465#false} is VALID [2022-04-07 11:55:38,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {11465#false} assume !false; {11465#false} is VALID [2022-04-07 11:55:38,059 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-07 11:55:38,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:55:38,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {11465#false} assume !false; {11465#false} is VALID [2022-04-07 11:55:38,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {11465#false} assume 0 == ~cond; {11465#false} is VALID [2022-04-07 11:55:38,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {11465#false} ~cond := #in~cond; {11465#false} is VALID [2022-04-07 11:55:38,514 INFO L272 TraceCheckUtils]: 24: Hoare triple {11465#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11465#false} is VALID [2022-04-07 11:55:38,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {11583#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11465#false} is VALID [2022-04-07 11:55:38,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {11587#(< 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; {11583#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:55:38,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {11591#(< 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; {11587#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:55:38,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {11595#(< 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; {11591#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:55:38,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {11599#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11595#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-07 11:55:38,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {11603#(< 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; {11599#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-07 11:55:38,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {11607#(< 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; {11603#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-07 11:55:38,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {11611#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11607#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-07 11:55:38,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {11615#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11611#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-07 11:55:38,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {11619#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11615#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-07 11:55:38,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {11619#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-07 11:55:38,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-07 11:55:38,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {11630#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11623#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-07 11:55:38,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {11634#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11630#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-07 11:55:38,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {11638#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11634#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-07 11:55:38,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {11642#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11638#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-07 11:55:38,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {11646#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11642#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 11:55:38,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {11650#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11646#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:55:38,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {11464#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11650#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:55:38,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {11464#true} call #t~ret9 := main(); {11464#true} is VALID [2022-04-07 11:55:38,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11464#true} {11464#true} #50#return; {11464#true} is VALID [2022-04-07 11:55:38,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-04-07 11:55:38,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11464#true} is VALID [2022-04-07 11:55:38,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {11464#true} call ULTIMATE.init(); {11464#true} is VALID [2022-04-07 11:55:38,526 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-07 11:55:38,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085253990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:55:38,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:55:38,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 37 [2022-04-07 11:55:38,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430642765] [2022-04-07 11:55:38,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:55:38,527 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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 28 [2022-04-07 11:55:38,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:55:38,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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-07 11:55:38,562 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-07 11:55:38,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-07 11:55:38,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:55:38,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-07 11:55:38,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2022-04-07 11:55:38,563 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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-07 11:56:15,582 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-07 11:56:23,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 11:56:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:44,192 INFO L93 Difference]: Finished difference Result 176 states and 229 transitions. [2022-04-07 11:56:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-07 11:56:44,192 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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 28 [2022-04-07 11:56:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:56:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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-07 11:56:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2022-04-07 11:56:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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-07 11:56:44,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2022-04-07 11:56:44,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 162 transitions. [2022-04-07 11:56:44,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:56:44,921 INFO L225 Difference]: With dead ends: 176 [2022-04-07 11:56:44,921 INFO L226 Difference]: Without dead ends: 160 [2022-04-07 11:56:44,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4792 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=2094, Invalid=15996, Unknown=0, NotChecked=0, Total=18090 [2022-04-07 11:56:44,924 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 148 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 395 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:56:44,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 114 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 790 Invalid, 1 Unknown, 0 Unchecked, 16.0s Time] [2022-04-07 11:56:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-07 11:56:46,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 103. [2022-04-07 11:56:46,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:56:46,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:56:46,458 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:56:46,458 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:56:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:46,460 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-07 11:56:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-07 11:56:46,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:46,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:46,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states. [2022-04-07 11:56:46,461 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 160 states. [2022-04-07 11:56:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:46,463 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-07 11:56:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-07 11:56:46,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:46,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:46,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:56:46,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:56:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:56:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2022-04-07 11:56:46,465 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 28 [2022-04-07 11:56:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:56:46,466 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2022-04-07 11:56:46,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 36 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-07 11:56:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2022-04-07 11:56:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 11:56:46,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:56:46,466 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:56:46,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-07 11:56:46,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-07 11:56:46,684 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:56:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:56:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash -412950633, now seen corresponding path program 19 times [2022-04-07 11:56:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:56:46,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780218757] [2022-04-07 11:56:46,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:56:46,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:56:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:47,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:56:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:47,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {12729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-07 11:56:47,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-07 11:56:47,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-07 11:56:47,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {12704#true} call ULTIMATE.init(); {12729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:56:47,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {12729#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-07 11:56:47,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-07 11:56:47,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-07 11:56:47,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#true} call #t~ret9 := main(); {12704#true} is VALID [2022-04-07 11:56:47,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:56:47,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {12709#(= 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; {12710#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:56:47,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {12710#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12711#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:56:47,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {12711#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= 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; {12712#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-07 11:56:47,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {12712#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12713#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-07 11:56:47,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {12713#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) 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; {12714#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-07 11:56:47,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {12714#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12715#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-07 11:56:47,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {12715#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) 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; {12716#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-07 11:56:47,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {12716#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12717#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 8)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-07 11:56:47,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {12717#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 8)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-07 11:56:47,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-07 11:56:47,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {12718#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {12719#(and (<= (+ 1 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-07 11:56:47,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {12719#(and (<= (+ 1 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= main_~n~0 (+ 7 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; {12720#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 2 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-07 11:56:47,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {12720#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 2 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {12721#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-07 11:56:47,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {12721#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12722#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 4) main_~x~0))} is VALID [2022-04-07 11:56:47,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {12722#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 4) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12723#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-07 11:56:47,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {12723#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 5) 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; {12724#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-07 11:56:47,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {12724#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) 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; {12725#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ 7 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-07 11:56:47,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {12725#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ 7 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296)) 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; {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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-07 11:56:47,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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); {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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-07 11:56:47,498 INFO L272 TraceCheckUtils]: 25: Hoare triple {12726#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ 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)); {12727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:56:47,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {12727#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12728#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:56:47,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {12728#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12705#false} is VALID [2022-04-07 11:56:47,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#false} assume !false; {12705#false} is VALID [2022-04-07 11:56:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:56:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:56:47,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780218757] [2022-04-07 11:56:47,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780218757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:56:47,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199969091] [2022-04-07 11:56:47,499 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 11:56:47,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:56:47,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:56:47,503 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-07 11:56:47,507 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-07 11:56:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:47,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-07 11:56:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:47,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:56:47,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {12704#true} call ULTIMATE.init(); {12704#true} is VALID [2022-04-07 11:56:47,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {12704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-07 11:56:47,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-07 11:56:47,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-07 11:56:47,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#true} call #t~ret9 := main(); {12704#true} is VALID [2022-04-07 11:56:47,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:56:47,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {12709#(= 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; {12751#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-07 11:56:47,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {12751#(= (+ 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; {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-07 11:56:47,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12759#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:56:47,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {12759#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12763#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:56:47,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {12763#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12767#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {12767#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12771#(= (+ main_~x~0 2) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {12771#(= (+ main_~x~0 2) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12775#(= (+ main_~x~0 3) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {12775#(= (+ main_~x~0 3) (+ main_~n~0 (- 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} assume !(~x~0 % 4294967296 > 0); {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} ~z~0 := ~y~0; {12779#(= (+ main_~x~0 4) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {12779#(= (+ main_~x~0 4) (+ main_~n~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; {12775#(= (+ main_~x~0 3) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {12775#(= (+ main_~x~0 3) (+ main_~n~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; {12771#(= (+ main_~x~0 2) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {12771#(= (+ main_~x~0 2) (+ main_~n~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; {12767#(= (+ main_~x~0 1) (+ main_~n~0 (- 4)))} is VALID [2022-04-07 11:56:47,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {12767#(= (+ main_~x~0 1) (+ main_~n~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; {12763#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-07 11:56:47,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {12763#(= (+ main_~n~0 (- 3)) (+ 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; {12759#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-07 11:56:47,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {12759#(= (+ (- 2) 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; {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-07 11:56:47,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {12755#(= (+ main_~x~0 2 (* (- 1) main_~n~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; {12751#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-07 11:56:47,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {12751#(= (+ 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; {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:56:47,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-07 11:56:47,923 INFO L272 TraceCheckUtils]: 25: Hoare triple {12709#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:56:47,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:56:47,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {12820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12705#false} is VALID [2022-04-07 11:56:47,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#false} assume !false; {12705#false} is VALID [2022-04-07 11:56:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:56:47,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:56:48,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {12705#false} assume !false; {12705#false} is VALID [2022-04-07 11:56:48,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {12820#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12705#false} is VALID [2022-04-07 11:56:48,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12820#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:56:48,422 INFO L272 TraceCheckUtils]: 25: Hoare triple {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12816#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:56:48,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:56:48,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {12843#(= (mod main_~n~0 4294967296) (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; {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:56:48,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {12847#(= (mod main_~n~0 4294967296) (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; {12843#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:56:48,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12847#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:56:48,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {12855#(= (mod main_~n~0 4294967296) (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; {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:56:48,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {12859#(= (mod main_~n~0 4294967296) (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; {12855#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:56:48,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12859#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:56:48,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-07 11:56:48,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-07 11:56:48,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-07 11:56:48,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-07 11:56:48,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12871#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-07 11:56:48,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12867#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-07 11:56:48,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {12859#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12863#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-07 11:56:48,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {12855#(= (mod main_~n~0 4294967296) (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; {12859#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-07 11:56:48,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12855#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-07 11:56:48,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {12847#(= (mod main_~n~0 4294967296) (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; {12851#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-07 11:56:48,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {12843#(= (mod main_~n~0 4294967296) (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; {12847#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-07 11:56:48,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12843#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-07 11:56:48,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12836#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-07 11:56:48,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#true} call #t~ret9 := main(); {12704#true} is VALID [2022-04-07 11:56:48,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#true} {12704#true} #50#return; {12704#true} is VALID [2022-04-07 11:56:48,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#true} assume true; {12704#true} is VALID [2022-04-07 11:56:48,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {12704#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12704#true} is VALID [2022-04-07 11:56:48,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {12704#true} call ULTIMATE.init(); {12704#true} is VALID [2022-04-07 11:56:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:56:48,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199969091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:56:48,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:56:48,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 42 [2022-04-07 11:56:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574415129] [2022-04-07 11:56:48,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:56:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-07 11:56:48,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:56:48,441 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), 39 states have internal predecessors, (67), 4 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-07 11:56:48,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:56:48,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-07 11:56:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:56:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-07 11:56:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2022-04-07 11:56:48,518 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 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-07 11:56:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:53,116 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2022-04-07 11:56:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 11:56:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-07 11:56:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:56:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 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-07 11:56:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-07 11:56:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 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-07 11:56:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-07 11:56:53,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 49 transitions. [2022-04-07 11:56:53,185 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-07 11:56:53,187 INFO L225 Difference]: With dead ends: 126 [2022-04-07 11:56:53,187 INFO L226 Difference]: Without dead ends: 121 [2022-04-07 11:56:53,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=265, Invalid=3395, Unknown=0, NotChecked=0, Total=3660 [2022-04-07 11:56:53,188 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 11:56:53,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 114 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 11:56:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-07 11:56:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2022-04-07 11:56:54,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:56:54,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 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-07 11:56:54,834 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 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-07 11:56:54,834 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 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-07 11:56:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:54,836 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-07 11:56:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-07 11:56:54,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:54,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:54,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 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 121 states. [2022-04-07 11:56:54,836 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 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 121 states. [2022-04-07 11:56:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:56:54,838 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-07 11:56:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-07 11:56:54,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:56:54,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:56:54,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:56:54,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:56:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 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-07 11:56:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2022-04-07 11:56:54,839 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 29 [2022-04-07 11:56:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:56:54,840 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2022-04-07 11:56:54,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 39 states have internal predecessors, (67), 4 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-07 11:56:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2022-04-07 11:56:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 11:56:54,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:56:54,840 INFO L499 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:56:54,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-07 11:56:55,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-07 11:56:55,041 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:56:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:56:55,041 INFO L85 PathProgramCache]: Analyzing trace with hash -673865428, now seen corresponding path program 20 times [2022-04-07 11:56:55,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:56:55,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493919109] [2022-04-07 11:56:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:56:55,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:56:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:56:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:55,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {13643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-07 11:56:55,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-07 11:56:55,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-07 11:56:55,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:56:55,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {13643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-07 11:56:55,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-07 11:56:55,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-07 11:56:55,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {13622#true} call #t~ret9 := main(); {13622#true} is VALID [2022-04-07 11:56:55,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {13622#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13627#(= main_~y~0 0)} is VALID [2022-04-07 11:56:55,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {13627#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:56:55,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:56:55,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:56:55,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:55,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:56:55,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:56:55,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:56:55,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:56:55,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {13635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-07 11:56:55,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {13635#(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; {13636#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:56:55,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {13636#(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; {13637#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:56:55,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {13637#(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; {13638#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:56:55,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {13638#(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; {13639#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:56:55,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {13639#(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; {13640#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:56:55,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {13640#(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; {13641#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:56:55,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {13641#(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; {13642#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:56:55,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {13642#(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; {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {13623#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; {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {13623#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; {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {13623#false} assume !(~z~0 % 4294967296 > 0); {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L272 TraceCheckUtils]: 26: Hoare triple {13623#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2022-04-07 11:56:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 11:56:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:56:55,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493919109] [2022-04-07 11:56:55,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493919109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:56:55,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331184447] [2022-04-07 11:56:55,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:56:55,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:56:55,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:56:55,356 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-07 11:56:55,364 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-07 11:56:55,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:56:55,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:56:55,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-07 11:56:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:56:55,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:56:55,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13622#true} is VALID [2022-04-07 11:56:55,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {13622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-07 11:56:55,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-07 11:56:55,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-07 11:56:55,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {13622#true} call #t~ret9 := main(); {13622#true} is VALID [2022-04-07 11:56:55,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {13622#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13627#(= main_~y~0 0)} is VALID [2022-04-07 11:56:55,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {13627#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:56:55,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {13628#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:56:55,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {13629#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:56:55,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {13630#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:56:55,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {13631#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:56:55,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {13632#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:56:55,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {13633#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:56:55,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:56:55,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {13634#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {13635#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-07 11:56:55,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {13635#(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; {13636#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-07 11:56:55,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {13636#(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; {13637#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-07 11:56:55,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {13637#(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; {13638#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-07 11:56:55,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {13638#(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; {13639#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-07 11:56:55,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {13639#(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; {13640#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-07 11:56:55,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {13640#(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; {13641#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-07 11:56:55,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {13641#(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; {13642#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-07 11:56:55,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {13642#(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; {13713#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-07 11:56:55,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {13713#(and (<= (+ main_~z~0 1) 0) (<= 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; {13717#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} is VALID [2022-04-07 11:56:55,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {13717#(and (<= (+ main_~z~0 2) 0) (<= 0 (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13721#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} is VALID [2022-04-07 11:56:55,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {13721#(and (<= 0 (+ main_~z~0 3)) (<= (+ main_~z~0 3) 0))} assume !(~z~0 % 4294967296 > 0); {13623#false} is VALID [2022-04-07 11:56:55,926 INFO L272 TraceCheckUtils]: 26: Hoare triple {13623#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13623#false} is VALID [2022-04-07 11:56:55,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2022-04-07 11:56:55,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2022-04-07 11:56:55,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2022-04-07 11:56:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:56:55,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:56:56,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {13623#false} assume !false; {13623#false} is VALID [2022-04-07 11:56:56,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {13623#false} assume 0 == ~cond; {13623#false} is VALID [2022-04-07 11:56:56,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {13623#false} ~cond := #in~cond; {13623#false} is VALID [2022-04-07 11:56:56,500 INFO L272 TraceCheckUtils]: 26: Hoare triple {13623#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13623#false} is VALID [2022-04-07 11:56:56,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {13749#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13623#false} is VALID [2022-04-07 11:56:56,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(< 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; {13749#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:56:56,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {13757#(< 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; {13753#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:56:56,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {13761#(< 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; {13757#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-07 11:56:56,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {13765#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13761#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-07 11:56:56,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {13769#(< 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; {13765#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-07 11:56:56,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {13773#(< 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; {13769#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-07 11:56:56,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {13777#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13773#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-07 11:56:56,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {13781#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13777#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-07 11:56:56,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {13785#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13781#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-07 11:56:56,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {13789#(< 0 (mod (+ main_~z~0 4294967286) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13785#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-07 11:56:56,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} ~z~0 := ~y~0; {13789#(< 0 (mod (+ main_~z~0 4294967286) 4294967296))} is VALID [2022-04-07 11:56:56,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-07 11:56:56,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {13800#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13793#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-07 11:56:56,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {13804#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13800#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-07 11:56:56,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {13808#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13804#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:56,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {13812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13808#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-07 11:56:56,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {13816#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:56,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {13820#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13816#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:56,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {13824#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13820#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-07 11:56:56,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {13622#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13824#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-07 11:56:56,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {13622#true} call #t~ret9 := main(); {13622#true} is VALID [2022-04-07 11:56:56,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13622#true} {13622#true} #50#return; {13622#true} is VALID [2022-04-07 11:56:56,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {13622#true} assume true; {13622#true} is VALID [2022-04-07 11:56:56,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {13622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13622#true} is VALID [2022-04-07 11:56:56,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {13622#true} call ULTIMATE.init(); {13622#true} is VALID [2022-04-07 11:56:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:56:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331184447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:56:56,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:56:56,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 41 [2022-04-07 11:56:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559349186] [2022-04-07 11:56:56,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:56:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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-07 11:56:56,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:56:56,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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-07 11:56:56,570 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-07 11:56:56,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-07 11:56:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:56:56,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-07 11:56:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1389, Unknown=0, NotChecked=0, Total=1640 [2022-04-07 11:56:56,572 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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-07 11:58:26,756 WARN L232 SmtUtils]: Spent 6.31s 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-07 11:59:35,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 11:59:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:59:38,798 INFO L93 Difference]: Finished difference Result 192 states and 250 transitions. [2022-04-07 11:59:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-04-07 11:59:38,798 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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-07 11:59:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:59:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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-07 11:59:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 194 transitions. [2022-04-07 11:59:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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-07 11:59:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 194 transitions. [2022-04-07 11:59:38,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 194 transitions. [2022-04-07 11:59:40,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:59:40,510 INFO L225 Difference]: With dead ends: 192 [2022-04-07 11:59:40,510 INFO L226 Difference]: Without dead ends: 175 [2022-04-07 11:59:40,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7207 ImplicationChecksByTransitivity, 85.3s TimeCoverageRelationStatistics Valid=2894, Invalid=22866, Unknown=0, NotChecked=0, Total=25760 [2022-04-07 11:59:40,512 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 186 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2022-04-07 11:59:40,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 136 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 36.6s Time] [2022-04-07 11:59:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-07 11:59:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 106. [2022-04-07 11:59:42,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:59:42,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:59:42,263 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:59:42,263 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:59:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:59:42,265 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2022-04-07 11:59:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2022-04-07 11:59:42,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:59:42,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:59:42,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 175 states. [2022-04-07 11:59:42,266 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 175 states. [2022-04-07 11:59:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:59:42,269 INFO L93 Difference]: Finished difference Result 175 states and 223 transitions. [2022-04-07 11:59:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2022-04-07 11:59:42,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:59:42,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:59:42,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:59:42,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:59:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:59:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions. [2022-04-07 11:59:42,271 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 30 [2022-04-07 11:59:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:59:42,271 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 135 transitions. [2022-04-07 11:59:42,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 40 states have internal predecessors, (51), 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-07 11:59:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2022-04-07 11:59:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 11:59:42,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:59:42,272 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:59:42,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-07 11:59:42,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:59:42,476 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:59:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:59:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -122528469, now seen corresponding path program 21 times [2022-04-07 11:59:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:59:42,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263613718] [2022-04-07 11:59:42,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:59:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:59:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:59:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:59:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:59:42,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {15014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-07 11:59:42,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-07 11:59:42,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-07 11:59:42,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {14990#true} call ULTIMATE.init(); {15014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:59:42,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {15014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-07 11:59:42,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-07 11:59:42,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-07 11:59:42,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {14990#true} call #t~ret9 := main(); {14990#true} is VALID [2022-04-07 11:59:42,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {14990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14995#(= main_~y~0 0)} is VALID [2022-04-07 11:59:42,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {14995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:59:42,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:59:42,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:59:42,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:59:42,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:59:42,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:59:42,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:59:42,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {15002#(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; {15003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:59:42,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {15003#(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; {15004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:59:42,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {15004#(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; {15005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:59:42,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {15005#(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; {15006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:59:42,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {15006#(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; {15007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:59:42,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {15007#(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; {15008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:59:42,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {15008#(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; {15009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 11:59:42,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {15009#(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; {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-07 11:59:42,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-07 11:59:42,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-07 11:59:42,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-07 11:59:42,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15013#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-07 11:59:42,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {15013#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14991#false} is VALID [2022-04-07 11:59:42,832 INFO L272 TraceCheckUtils]: 26: Hoare triple {14991#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14991#false} is VALID [2022-04-07 11:59:42,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {14991#false} ~cond := #in~cond; {14991#false} is VALID [2022-04-07 11:59:42,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {14991#false} assume 0 == ~cond; {14991#false} is VALID [2022-04-07 11:59:42,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {14991#false} assume !false; {14991#false} is VALID [2022-04-07 11:59:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:59:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:59:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263613718] [2022-04-07 11:59:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263613718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:59:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905044619] [2022-04-07 11:59:42,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 11:59:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:59:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:59:42,834 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-07 11:59:42,835 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-07 11:59:43,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-07 11:59:43,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:59:43,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-07 11:59:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:59:43,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:59:43,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {14990#true} call ULTIMATE.init(); {14990#true} is VALID [2022-04-07 11:59:43,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {14990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-07 11:59:43,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-07 11:59:43,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-07 11:59:43,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {14990#true} call #t~ret9 := main(); {14990#true} is VALID [2022-04-07 11:59:43,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {14990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14995#(= main_~y~0 0)} is VALID [2022-04-07 11:59:43,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {14995#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-07 11:59:43,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {14996#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-07 11:59:43,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {14997#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-07 11:59:43,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {14998#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-07 11:59:43,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {14999#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-07 11:59:43,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {15000#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-07 11:59:43,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {15001#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15002#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-07 11:59:43,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {15002#(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; {15003#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-07 11:59:43,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {15003#(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; {15004#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-07 11:59:43,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {15004#(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; {15005#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-07 11:59:43,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {15005#(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; {15006#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-07 11:59:43,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {15006#(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; {15007#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-07 11:59:43,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {15007#(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; {15008#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-07 11:59:43,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {15008#(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; {15009#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-07 11:59:43,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {15009#(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; {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-07 11:59:43,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {15010#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-07 11:59:43,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-07 11:59:43,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {15011#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-07 11:59:43,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {15012#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15090#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-07 11:59:43,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {15090#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14991#false} is VALID [2022-04-07 11:59:43,370 INFO L272 TraceCheckUtils]: 26: Hoare triple {14991#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14991#false} is VALID [2022-04-07 11:59:43,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {14991#false} ~cond := #in~cond; {14991#false} is VALID [2022-04-07 11:59:43,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {14991#false} assume 0 == ~cond; {14991#false} is VALID [2022-04-07 11:59:43,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {14991#false} assume !false; {14991#false} is VALID [2022-04-07 11:59:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:59:43,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:59:43,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {14991#false} assume !false; {14991#false} is VALID [2022-04-07 11:59:43,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {14991#false} assume 0 == ~cond; {14991#false} is VALID [2022-04-07 11:59:43,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {14991#false} ~cond := #in~cond; {14991#false} is VALID [2022-04-07 11:59:43,944 INFO L272 TraceCheckUtils]: 26: Hoare triple {14991#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14991#false} is VALID [2022-04-07 11:59:43,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {15118#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14991#false} is VALID [2022-04-07 11:59:43,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {15122#(< 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; {15118#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-07 11:59:43,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {15122#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-07 11:59:43,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:59:43,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {15133#(< 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; {15126#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-07 11:59:43,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {15137#(< 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; {15133#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-07 11:59:43,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {15141#(< 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; {15137#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-07 11:59:43,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {15145#(< 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; {15141#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-07 11:59:43,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {15149#(< 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; {15145#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-07 11:59:43,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {15153#(< 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; {15149#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-07 11:59:43,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {15157#(< 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; {15153#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-07 11:59:43,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {15161#(< 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; {15157#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-07 11:59:43,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {15165#(< 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; {15161#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-07 11:59:43,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {15169#(< 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; {15165#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-07 11:59:43,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {15173#(< 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; {15169#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-07 11:59:43,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {15177#(< 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; {15173#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-07 11:59:43,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {15181#(< 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; {15177#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-07 11:59:43,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {15185#(< 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; {15181#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-07 11:59:43,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {15189#(< 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; {15185#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-07 11:59:43,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {15193#(< 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; {15189#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-07 11:59:43,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {14990#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15193#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-07 11:59:43,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {14990#true} call #t~ret9 := main(); {14990#true} is VALID [2022-04-07 11:59:43,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14990#true} {14990#true} #50#return; {14990#true} is VALID [2022-04-07 11:59:43,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {14990#true} assume true; {14990#true} is VALID [2022-04-07 11:59:43,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {14990#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14990#true} is VALID [2022-04-07 11:59:43,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {14990#true} call ULTIMATE.init(); {14990#true} is VALID [2022-04-07 11:59:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:59:43,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905044619] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:59:43,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:59:43,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-07 11:59:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457417045] [2022-04-07 11:59:43,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:59:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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-07 11:59:43,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:59:43,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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-07 11:59:43,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:59:43,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-07 11:59:43,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:59:43,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-07 11:59:43,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-07 11:59:43,999 INFO L87 Difference]: Start difference. First operand 106 states and 135 transitions. Second operand has 42 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 41 states have internal predecessors, (50), 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-07 12:00:09,523 WARN L232 SmtUtils]: Spent 15.05s 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-07 12:00:31,118 WARN L232 SmtUtils]: Spent 10.33s 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-07 12:01:00,712 WARN L232 SmtUtils]: Spent 19.64s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:01:12,773 WARN L232 SmtUtils]: Spent 7.36s 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-07 12:01:15,280 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ 2 c_main_~y~0) 4294967296)) (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod (+ 11 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~y~0 4294967296)) (< 0 (mod (+ 13 c_main_~y~0) 4294967296)) (< 0 (mod (+ 3 c_main_~y~0) 4294967296)) (< 0 (mod (+ c_main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~y~0) 4294967296)) (< 0 (mod (+ 15 c_main_~y~0) 4294967296)) (< 0 (mod (+ 8 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~z~0 4294967296)) (< 0 (mod (+ 6 c_main_~y~0) 4294967296)) (< 0 (mod (+ 5 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4 c_main_~y~0) 4294967296)) (< 0 (mod (+ 9 c_main_~y~0) 4294967296)) (< 0 (mod (+ 14 c_main_~y~0) 4294967296)) (< 0 (mod (+ 10 c_main_~y~0) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< 0 (mod (+ 7 c_main_~y~0) 4294967296)) (< 0 (mod (+ 12 c_main_~y~0) 4294967296))) is different from false [2022-04-07 12:01:41,933 WARN L232 SmtUtils]: Spent 13.90s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:01:54,102 WARN L232 SmtUtils]: Spent 5.69s 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-07 12:02:12,756 WARN L232 SmtUtils]: Spent 11.73s 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-07 12:02:31,933 WARN L232 SmtUtils]: Spent 11.30s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:02:56,678 WARN L232 SmtUtils]: Spent 6.50s 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-07 12:03:11,554 WARN L232 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:03:41,285 WARN L232 SmtUtils]: Spent 9.76s 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-07 12:04:02,552 WARN L232 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:04:23,631 WARN L232 SmtUtils]: Spent 7.06s 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-07 12:04:40,752 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ 2 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~z~0) 4294967296)) (= |c_#NULL.base| |c_old(#NULL.base)|) (< 0 (mod (+ 11 c_main_~y~0) 4294967296)) (< 0 (mod c_main_~y~0 4294967296)) (< 0 (mod (+ 3 c_main_~y~0) 4294967296)) (< 0 (mod (+ c_main_~y~0 1) 4294967296)) (< 0 (mod (+ 4294967295 c_main_~y~0) 4294967296)) (< 0 (mod (+ 8 c_main_~y~0) 4294967296)) (< 0 (mod (+ 6 c_main_~y~0) 4294967296)) (< 0 (mod (+ 5 c_main_~y~0) 4294967296)) (< 0 (mod (+ 4 c_main_~y~0) 4294967296)) (< 0 (mod (+ 9 c_main_~y~0) 4294967296)) (< 0 (mod (+ 10 c_main_~y~0) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< 0 (mod (+ 7 c_main_~y~0) 4294967296)) (< 0 (mod (+ 12 c_main_~y~0) 4294967296))) is different from false