/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-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:09:10,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:09:10,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:09:10,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:09:10,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:09:10,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:09:10,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:09:10,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:09:10,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:09:10,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:09:10,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:09:10,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:09:10,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:09:10,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:09:10,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:09:10,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:09:10,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:09:10,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:09:10,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:09:10,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:09:10,848 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:09:10,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:09:10,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:09:10,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:09:10,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:09:10,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:09:10,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:09:10,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:09:10,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:09:10,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:09:10,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:09:10,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:09:10,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:09:10,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:09:10,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:09:10,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:09:10,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:09:10,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:09:10,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:09:10,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:09:10,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:09:10,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:09:10,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:09:10,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:09:10,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:09:10,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:09:10,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:09:10,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:09:10,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:09:10,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:09:10,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:09:10,881 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:09:10,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:09:10,882 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:09:10,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:09:10,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:09:10,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:09:10,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:09:10,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:09:10,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:09:10,883 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:09:10,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:09:10,883 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:09:10,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:09:10,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:09:10,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:09:10,884 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:09:10,885 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:09:10,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:09:10,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:09:11,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:09:11,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:09:11,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:09:11,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:09:11,078 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:09:11,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-27 11:09:11,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c471e625/ef13e1c939c84d539722a4183d3e94de/FLAGb65dea818 [2022-04-27 11:09:11,484 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:09:11,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-27 11:09:11,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c471e625/ef13e1c939c84d539722a4183d3e94de/FLAGb65dea818 [2022-04-27 11:09:11,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c471e625/ef13e1c939c84d539722a4183d3e94de [2022-04-27 11:09:11,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:09:11,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:09:11,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:09:11,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:09:11,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:09:11,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ab4b595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11, skipping insertion in model container [2022-04-27 11:09:11,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:09:11,523 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:09:11,635 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-de32.c[368,381] [2022-04-27 11:09:11,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:09:11,649 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:09:11,658 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-de32.c[368,381] [2022-04-27 11:09:11,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:09:11,669 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:09:11,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11 WrapperNode [2022-04-27 11:09:11,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:09:11,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:09:11,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:09:11,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:09:11,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:09:11,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:09:11,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:09:11,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:09:11,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (1/1) ... [2022-04-27 11:09:11,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:09:11,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:11,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:09:11,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:09:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:09:11,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:09:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:09:11,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:09:11,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:09:11,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:09:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:09:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:09:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:09:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:09:11,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:09:11,791 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:09:11,792 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:09:11,956 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:09:11,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:09:11,961 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 11:09:11,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:09:11 BoogieIcfgContainer [2022-04-27 11:09:11,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:09:11,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:09:11,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:09:11,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:09:11,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:09:11" (1/3) ... [2022-04-27 11:09:11,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e79aa39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:09:11, skipping insertion in model container [2022-04-27 11:09:11,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:09:11" (2/3) ... [2022-04-27 11:09:11,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e79aa39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:09:11, skipping insertion in model container [2022-04-27 11:09:11,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:09:11" (3/3) ... [2022-04-27 11:09:11,983 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-04-27 11:09:11,992 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:09:11,992 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:09:12,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:09:12,033 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@184356c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@653b9bcb [2022-04-27 11:09:12,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:09:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:09:12,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:09:12,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:12,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:12,047 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-27 11:09:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:12,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076479787] [2022-04-27 11:09:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:12,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-27 11:09:12,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:09:12,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-27 11:09:12,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:12,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-27 11:09:12,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 11:09:12,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-27 11:09:12,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-27 11:09:12,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25#true} is VALID [2022-04-27 11:09:12,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !(~x~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:09:12,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:09:12,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:09:12,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-27 11:09:12,324 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:12,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:12,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-27 11:09:12,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 11:09:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:12,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:12,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076479787] [2022-04-27 11:09:12,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076479787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:09:12,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:09:12,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:09:12,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7457176] [2022-04-27 11:09:12,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:09:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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-27 11:09:12,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:12,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) 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-27 11:09:12,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:12,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:09:12,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:12,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:09:12,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:09:12,379 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) 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-27 11:09:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:12,648 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 11:09:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:09:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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-27 11:09:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) 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-27 11:09:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-27 11:09:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) 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-27 11:09:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-27 11:09:12,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-27 11:09:12,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:12,765 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:09:12,766 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:09:12,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:09:12,774 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:12,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:09:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:09:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:09:12,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:12,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,800 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,801 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:12,803 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 11:09:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 11:09:12,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:12,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:12,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:09:12,805 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:09:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:12,807 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 11:09:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 11:09:12,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:12,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:12,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:12,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-27 11:09:12,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-27 11:09:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:12,812 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-27 11:09:12,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) 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-27 11:09:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 11:09:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:09:12,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:12,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:12,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:09:12,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-04-27 11:09:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:12,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167999160] [2022-04-27 11:09:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:12,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:12,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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-27 11:09:12,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-27 11:09:12,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #61#return; {165#true} is VALID [2022-04-27 11:09:12,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:12,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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-27 11:09:12,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-27 11:09:12,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #61#return; {165#true} is VALID [2022-04-27 11:09:12,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret11 := main(); {165#true} is VALID [2022-04-27 11:09:12,894 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-27 11:09:12,895 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-27 11:09:12,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(= main_~y~0 0)} ~z~0 := ~y~0; {170#(= main_~y~0 0)} is VALID [2022-04-27 11:09:12,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {170#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {170#(= main_~y~0 0)} is VALID [2022-04-27 11:09:12,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {166#false} is VALID [2022-04-27 11:09:12,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#false} assume !(~y~0 % 4294967296 > 0); {166#false} is VALID [2022-04-27 11:09:12,896 INFO L272 TraceCheckUtils]: 11: Hoare triple {166#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {166#false} is VALID [2022-04-27 11:09:12,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#false} ~cond := #in~cond; {166#false} is VALID [2022-04-27 11:09:12,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#false} assume 0 == ~cond; {166#false} is VALID [2022-04-27 11:09:12,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-27 11:09:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:12,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167999160] [2022-04-27 11:09:12,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167999160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:09:12,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:09:12,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:09:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108799847] [2022-04-27 11:09:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:09:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:09:12,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:12,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:12,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:09:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:09:12,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:09:12,910 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:12,975 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-27 11:09:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:09:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:09:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 11:09:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-27 11:09:12,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-27 11:09:13,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:13,006 INFO L225 Difference]: With dead ends: 30 [2022-04-27 11:09:13,006 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 11:09:13,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:09:13,010 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:13,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:09:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 11:09:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 11:09:13,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:13,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,019 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,019 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,020 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 11:09:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 11:09:13,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:13,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:13,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:09:13,021 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 11:09:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,022 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 11:09:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 11:09:13,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:13,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:13,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:13,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-27 11:09:13,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-27 11:09:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:13,027 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-27 11:09:13,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 11:09:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 11:09:13,028 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:13,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:13,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:09:13,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-04-27 11:09:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:13,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259709798] [2022-04-27 11:09:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:13,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-27 11:09:13,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-27 11:09:13,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-27 11:09:13,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:13,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-27 11:09:13,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-27 11:09:13,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-27 11:09:13,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret11 := main(); {301#true} is VALID [2022-04-27 11:09:13,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {306#(= main_~y~0 0)} is VALID [2022-04-27 11:09:13,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {306#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {306#(= main_~y~0 0)} is VALID [2022-04-27 11:09:13,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {306#(= main_~y~0 0)} ~z~0 := ~y~0; {307#(= main_~z~0 0)} is VALID [2022-04-27 11:09:13,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#(= 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; {302#false} is VALID [2022-04-27 11:09:13,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#false} assume !(~z~0 % 4294967296 > 0); {302#false} is VALID [2022-04-27 11:09:13,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#false} assume !(~y~0 % 4294967296 > 0); {302#false} is VALID [2022-04-27 11:09:13,083 INFO L272 TraceCheckUtils]: 11: Hoare triple {302#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {302#false} is VALID [2022-04-27 11:09:13,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#false} ~cond := #in~cond; {302#false} is VALID [2022-04-27 11:09:13,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {302#false} assume 0 == ~cond; {302#false} is VALID [2022-04-27 11:09:13,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-27 11:09:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:13,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259709798] [2022-04-27 11:09:13,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259709798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:09:13,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:09:13,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:09:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637128100] [2022-04-27 11:09:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:09:13,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:09:13,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:13,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:09:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:09:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:09:13,095 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,160 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 11:09:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:09:13,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 11:09:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 11:09:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-27 11:09:13,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-27 11:09:13,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:13,184 INFO L225 Difference]: With dead ends: 27 [2022-04-27 11:09:13,184 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 11:09:13,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:09:13,185 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:13,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:09:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 11:09:13,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 11:09:13,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:13,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,188 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,188 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,189 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 11:09:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 11:09:13,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:13,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:13,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:09:13,190 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:09:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,190 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 11:09:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 11:09:13,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:13,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:13,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:13,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-27 11:09:13,192 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-27 11:09:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:13,192 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-27 11:09:13,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 11:09:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:09:13,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:13,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:13,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:09:13,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:13,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-27 11:09:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:13,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510286939] [2022-04-27 11:09:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-27 11:09:13,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-27 11:09:13,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {420#true} {420#true} #61#return; {420#true} is VALID [2022-04-27 11:09:13,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:13,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-27 11:09:13,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-27 11:09:13,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #61#return; {420#true} is VALID [2022-04-27 11:09:13,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret11 := main(); {420#true} is VALID [2022-04-27 11:09:13,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {425#(= main_~y~0 0)} is VALID [2022-04-27 11:09:13,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(= 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; {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:13,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:13,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {427#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:13,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {427#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {421#false} is VALID [2022-04-27 11:09:13,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {421#false} is VALID [2022-04-27 11:09:13,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume !(~y~0 % 4294967296 > 0); {421#false} is VALID [2022-04-27 11:09:13,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {421#false} is VALID [2022-04-27 11:09:13,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#false} ~cond := #in~cond; {421#false} is VALID [2022-04-27 11:09:13,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {421#false} assume 0 == ~cond; {421#false} is VALID [2022-04-27 11:09:13,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-27 11:09:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:13,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:13,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510286939] [2022-04-27 11:09:13,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510286939] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:13,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682122173] [2022-04-27 11:09:13,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:13,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:13,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:13,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:09:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:09:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:13,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2022-04-27 11:09:13,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#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); {420#true} is VALID [2022-04-27 11:09:13,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-27 11:09:13,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #61#return; {420#true} is VALID [2022-04-27 11:09:13,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret11 := main(); {420#true} is VALID [2022-04-27 11:09:13,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {425#(= main_~y~0 0)} is VALID [2022-04-27 11:09:13,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(= 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; {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:13,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:13,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {426#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {456#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:13,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {421#false} is VALID [2022-04-27 11:09:13,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {421#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {421#false} is VALID [2022-04-27 11:09:13,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume !(~y~0 % 4294967296 > 0); {421#false} is VALID [2022-04-27 11:09:13,483 INFO L272 TraceCheckUtils]: 12: Hoare triple {421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {421#false} is VALID [2022-04-27 11:09:13,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#false} ~cond := #in~cond; {421#false} is VALID [2022-04-27 11:09:13,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {421#false} assume 0 == ~cond; {421#false} is VALID [2022-04-27 11:09:13,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-27 11:09:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:13,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:13,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-27 11:09:13,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {421#false} assume 0 == ~cond; {421#false} is VALID [2022-04-27 11:09:13,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#false} ~cond := #in~cond; {421#false} is VALID [2022-04-27 11:09:13,593 INFO L272 TraceCheckUtils]: 12: Hoare triple {421#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {421#false} is VALID [2022-04-27 11:09:13,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume !(~y~0 % 4294967296 > 0); {421#false} is VALID [2022-04-27 11:09:13,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {493#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {421#false} is VALID [2022-04-27 11:09:13,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {493#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:13,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#true} ~z~0 := ~y~0; {497#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:09:13,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#true} assume !(~x~0 % 4294967296 > 0); {420#true} is VALID [2022-04-27 11:09:13,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {420#true} is VALID [2022-04-27 11:09:13,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {420#true} is VALID [2022-04-27 11:09:13,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret11 := main(); {420#true} is VALID [2022-04-27 11:09:13,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #61#return; {420#true} is VALID [2022-04-27 11:09:13,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-27 11:09:13,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#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); {420#true} is VALID [2022-04-27 11:09:13,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2022-04-27 11:09:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:13,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682122173] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:13,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:09:13,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-04-27 11:09:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27963365] [2022-04-27 11:09:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:09:13,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:09:13,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:13,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:13,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:09:13,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:09:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:09:13,611 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,649 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-27 11:09:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:09:13,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:09:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 11:09:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 11:09:13,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-27 11:09:13,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:13,670 INFO L225 Difference]: With dead ends: 24 [2022-04-27 11:09:13,671 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:09:13,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:09:13,672 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:13,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:09:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:09:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:09:13,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:13,676 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-27 11:09:13,676 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-27 11:09:13,676 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-27 11:09:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,677 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:09:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:09:13,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:13,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:13,678 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-27 11:09:13,678 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-27 11:09:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:13,678 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:09:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:09:13,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:13,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:13,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:13,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:13,679 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-27 11:09:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 11:09:13,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-27 11:09:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:13,688 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 11:09:13,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:09:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:09:13,688 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:13,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:13,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:09:13,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:13,904 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 1 times [2022-04-27 11:09:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:13,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816324129] [2022-04-27 11:09:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:13,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:13,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-27 11:09:13,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-27 11:09:13,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #61#return; {624#true} is VALID [2022-04-27 11:09:13,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:13,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {624#true} is VALID [2022-04-27 11:09:13,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-27 11:09:13,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #61#return; {624#true} is VALID [2022-04-27 11:09:13,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret11 := main(); {624#true} is VALID [2022-04-27 11:09:13,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {629#(= main_~y~0 0)} is VALID [2022-04-27 11:09:13,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {629#(= 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; {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:09:13,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:09:13,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} ~z~0 := ~y~0; {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:09:13,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:09:13,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:09:13,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {630#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {625#false} is VALID [2022-04-27 11:09:13,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {625#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {625#false} is VALID [2022-04-27 11:09:13,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2022-04-27 11:09:13,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2022-04-27 11:09:13,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-27 11:09:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:13,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816324129] [2022-04-27 11:09:13,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816324129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:13,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580222617] [2022-04-27 11:09:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:13,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:13,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:14,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:09:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:14,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:09:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:14,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:14,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2022-04-27 11:09:14,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#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); {624#true} is VALID [2022-04-27 11:09:14,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-27 11:09:14,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #61#return; {624#true} is VALID [2022-04-27 11:09:14,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret11 := main(); {624#true} is VALID [2022-04-27 11:09:14,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {629#(= main_~y~0 0)} is VALID [2022-04-27 11:09:14,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {629#(= 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; {653#(= main_~y~0 1)} is VALID [2022-04-27 11:09:14,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#(= main_~y~0 1)} assume !(~x~0 % 4294967296 > 0); {653#(= main_~y~0 1)} is VALID [2022-04-27 11:09:14,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#(= main_~y~0 1)} ~z~0 := ~y~0; {660#(and (= main_~z~0 main_~y~0) (= main_~y~0 1))} is VALID [2022-04-27 11:09:14,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(and (= main_~z~0 main_~y~0) (= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {653#(= main_~y~0 1)} is VALID [2022-04-27 11:09:14,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {653#(= main_~y~0 1)} assume !(~z~0 % 4294967296 > 0); {653#(= main_~y~0 1)} is VALID [2022-04-27 11:09:14,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#(= main_~y~0 1)} assume !(~y~0 % 4294967296 > 0); {625#false} is VALID [2022-04-27 11:09:14,133 INFO L272 TraceCheckUtils]: 12: Hoare triple {625#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {625#false} is VALID [2022-04-27 11:09:14,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2022-04-27 11:09:14,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2022-04-27 11:09:14,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-27 11:09:14,135 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-27 11:09:14,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:14,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {625#false} assume !false; {625#false} is VALID [2022-04-27 11:09:14,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2022-04-27 11:09:14,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2022-04-27 11:09:14,203 INFO L272 TraceCheckUtils]: 12: Hoare triple {625#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {625#false} is VALID [2022-04-27 11:09:14,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {625#false} is VALID [2022-04-27 11:09:14,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {694#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {694#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:14,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {694#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:14,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {624#true} ~z~0 := ~y~0; {701#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:14,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {624#true} assume !(~x~0 % 4294967296 > 0); {624#true} is VALID [2022-04-27 11:09:14,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {624#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {624#true} is VALID [2022-04-27 11:09:14,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {624#true} is VALID [2022-04-27 11:09:14,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {624#true} call #t~ret11 := main(); {624#true} is VALID [2022-04-27 11:09:14,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {624#true} {624#true} #61#return; {624#true} is VALID [2022-04-27 11:09:14,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {624#true} assume true; {624#true} is VALID [2022-04-27 11:09:14,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {624#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); {624#true} is VALID [2022-04-27 11:09:14,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2022-04-27 11:09:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:14,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580222617] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:14,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:09:14,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2022-04-27 11:09:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000049472] [2022-04-27 11:09:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:09:14,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:09:14,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:14,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:14,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:09:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:09:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:09:14,218 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:14,245 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 11:09:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:09:14,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:09:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-27 11:09:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-04-27 11:09:14,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-04-27 11:09:14,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:14,269 INFO L225 Difference]: With dead ends: 23 [2022-04-27 11:09:14,269 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 11:09:14,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:09:14,271 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:14,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:09:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 11:09:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 11:09:14,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:14,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,298 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,298 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:14,298 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 11:09:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 11:09:14,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:14,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:14,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:09:14,299 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 11:09:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:14,299 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 11:09:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 11:09:14,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:14,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:14,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:14,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 11:09:14,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-27 11:09:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:14,301 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 11:09:14,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 11:09:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:09:14,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:14,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:14,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:14,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:14,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-27 11:09:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:14,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563589668] [2022-04-27 11:09:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:14,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {830#true} is VALID [2022-04-27 11:09:14,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 11:09:14,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {830#true} {830#true} #61#return; {830#true} is VALID [2022-04-27 11:09:14,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:14,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {830#true} is VALID [2022-04-27 11:09:14,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 11:09:14,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #61#return; {830#true} is VALID [2022-04-27 11:09:14,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret11 := main(); {830#true} is VALID [2022-04-27 11:09:14,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {830#true} is VALID [2022-04-27 11:09:14,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {830#true} is VALID [2022-04-27 11:09:14,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {830#true} assume !(~x~0 % 4294967296 > 0); {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:09:14,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:09:14,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,612 INFO L272 TraceCheckUtils]: 13: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:14,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {838#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:14,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {831#false} is VALID [2022-04-27 11:09:14,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {831#false} assume !false; {831#false} is VALID [2022-04-27 11:09:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:14,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563589668] [2022-04-27 11:09:14,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563589668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:14,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207512003] [2022-04-27 11:09:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:14,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:14,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:14,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:14,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:09:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:14,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:09:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:14,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:14,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2022-04-27 11:09:14,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#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); {830#true} is VALID [2022-04-27 11:09:14,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 11:09:14,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #61#return; {830#true} is VALID [2022-04-27 11:09:14,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret11 := main(); {830#true} is VALID [2022-04-27 11:09:14,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {830#true} is VALID [2022-04-27 11:09:14,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {830#true} is VALID [2022-04-27 11:09:14,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {830#true} assume !(~x~0 % 4294967296 > 0); {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:09:14,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:09:14,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:14,921 INFO L272 TraceCheckUtils]: 13: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:14,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:14,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {831#false} is VALID [2022-04-27 11:09:14,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {831#false} assume !false; {831#false} is VALID [2022-04-27 11:09:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:14,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:15,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {831#false} assume !false; {831#false} is VALID [2022-04-27 11:09:15,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {831#false} is VALID [2022-04-27 11:09:15,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:15,039 INFO L272 TraceCheckUtils]: 13: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:15,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:15,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:15,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:09:15,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {836#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-27 11:09:15,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:15,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {830#true} assume !(~x~0 % 4294967296 > 0); {835#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-27 11:09:15,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {830#true} is VALID [2022-04-27 11:09:15,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {830#true} is VALID [2022-04-27 11:09:15,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret11 := main(); {830#true} is VALID [2022-04-27 11:09:15,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #61#return; {830#true} is VALID [2022-04-27 11:09:15,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2022-04-27 11:09:15,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {830#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); {830#true} is VALID [2022-04-27 11:09:15,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2022-04-27 11:09:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:15,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207512003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:15,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:15,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-27 11:09:15,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923544266] [2022-04-27 11:09:15,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:15,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:09:15,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:15,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:15,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:09:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:15,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:09:15,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:09:15,060 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:15,234 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 11:09:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:09:15,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 11:09:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-27 11:09:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-27 11:09:15,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-27 11:09:15,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:15,260 INFO L225 Difference]: With dead ends: 26 [2022-04-27 11:09:15,260 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 11:09:15,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:09:15,261 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:15,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:09:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 11:09:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-27 11:09:15,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:15,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,269 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,269 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:15,270 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 11:09:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 11:09:15,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:15,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:15,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:09:15,270 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 11:09:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:15,271 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 11:09:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 11:09:15,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:15,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:15,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:15,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 11:09:15,272 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-27 11:09:15,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:15,272 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 11:09:15,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 11:09:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 11:09:15,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:15,273 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:15,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:15,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:15,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 2 times [2022-04-27 11:09:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:15,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575674761] [2022-04-27 11:09:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:15,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1063#true} is VALID [2022-04-27 11:09:15,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:09:15,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1063#true} {1063#true} #61#return; {1063#true} is VALID [2022-04-27 11:09:15,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:15,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1063#true} is VALID [2022-04-27 11:09:15,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:09:15,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #61#return; {1063#true} is VALID [2022-04-27 11:09:15,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret11 := main(); {1063#true} is VALID [2022-04-27 11:09:15,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1068#(= main_~y~0 0)} is VALID [2022-04-27 11:09:15,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1068#(= 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; {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1068#(= main_~y~0 0)} is VALID [2022-04-27 11:09:15,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {1068#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#false} is VALID [2022-04-27 11:09:15,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {1064#false} assume !(~y~0 % 4294967296 > 0); {1064#false} is VALID [2022-04-27 11:09:15,567 INFO L272 TraceCheckUtils]: 14: Hoare triple {1064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1064#false} is VALID [2022-04-27 11:09:15,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {1064#false} ~cond := #in~cond; {1064#false} is VALID [2022-04-27 11:09:15,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {1064#false} assume 0 == ~cond; {1064#false} is VALID [2022-04-27 11:09:15,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2022-04-27 11:09:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:15,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575674761] [2022-04-27 11:09:15,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575674761] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:15,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782357594] [2022-04-27 11:09:15,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:09:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:15,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:15,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:15,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 11:09:15,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:09:15,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:15,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:09:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:15,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:15,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1063#true} is VALID [2022-04-27 11:09:15,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {1063#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); {1063#true} is VALID [2022-04-27 11:09:15,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:09:15,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #61#return; {1063#true} is VALID [2022-04-27 11:09:15,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret11 := main(); {1063#true} is VALID [2022-04-27 11:09:15,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {1063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1068#(= main_~y~0 0)} is VALID [2022-04-27 11:09:15,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {1068#(= 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; {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1098#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {1098#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1102#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {1102#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !(~z~0 % 4294967296 > 0); {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:15,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {1069#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1068#(= main_~y~0 0)} is VALID [2022-04-27 11:09:15,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {1068#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#false} is VALID [2022-04-27 11:09:15,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {1064#false} assume !(~y~0 % 4294967296 > 0); {1064#false} is VALID [2022-04-27 11:09:15,699 INFO L272 TraceCheckUtils]: 14: Hoare triple {1064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1064#false} is VALID [2022-04-27 11:09:15,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {1064#false} ~cond := #in~cond; {1064#false} is VALID [2022-04-27 11:09:15,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1064#false} assume 0 == ~cond; {1064#false} is VALID [2022-04-27 11:09:15,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2022-04-27 11:09:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:15,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:15,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2022-04-27 11:09:15,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {1064#false} assume 0 == ~cond; {1064#false} is VALID [2022-04-27 11:09:15,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {1064#false} ~cond := #in~cond; {1064#false} is VALID [2022-04-27 11:09:15,818 INFO L272 TraceCheckUtils]: 14: Hoare triple {1064#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1064#false} is VALID [2022-04-27 11:09:15,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1064#false} assume !(~y~0 % 4294967296 > 0); {1064#false} is VALID [2022-04-27 11:09:15,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#false} is VALID [2022-04-27 11:09:15,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {1146#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1142#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:15,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {1150#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1146#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:15,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1154#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1150#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:09:15,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {1063#true} ~z~0 := ~y~0; {1154#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:09:15,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#true} assume !(~x~0 % 4294967296 > 0); {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {1063#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {1063#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret11 := main(); {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #61#return; {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1063#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); {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1063#true} is VALID [2022-04-27 11:09:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:09:15,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782357594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:15,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:15,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-27 11:09:15,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859527973] [2022-04-27 11:09:15,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:15,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-27 11:09:15,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:15,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:15,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:15,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:09:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:15,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:09:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:09:15,846 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:16,103 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 11:09:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:09:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-27 11:09:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-27 11:09:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-27 11:09:16,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2022-04-27 11:09:16,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:16,135 INFO L225 Difference]: With dead ends: 35 [2022-04-27 11:09:16,136 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 11:09:16,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:09:16,136 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:16,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:09:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 11:09:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 11:09:16,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:16,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,148 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,148 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:16,150 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 11:09:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:09:16,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:16,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:16,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 11:09:16,151 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-27 11:09:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:16,152 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 11:09:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:09:16,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:16,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:16,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:16,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 11:09:16,153 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-04-27 11:09:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:16,153 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 11:09:16,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:09:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 11:09:16,153 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:16,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:16,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:16,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:16,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1137046944, now seen corresponding path program 3 times [2022-04-27 11:09:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:16,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447708452] [2022-04-27 11:09:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:16,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {1335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1326#true} is VALID [2022-04-27 11:09:16,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 11:09:16,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1326#true} {1326#true} #61#return; {1326#true} is VALID [2022-04-27 11:09:16,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} call ULTIMATE.init(); {1335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:16,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1335#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1326#true} is VALID [2022-04-27 11:09:16,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 11:09:16,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} #61#return; {1326#true} is VALID [2022-04-27 11:09:16,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} call #t~ret11 := main(); {1326#true} is VALID [2022-04-27 11:09:16,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1331#(= main_~y~0 0)} is VALID [2022-04-27 11:09:16,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {1331#(= 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; {1332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:16,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(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; {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1334#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:09:16,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {1334#(and (<= 1 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {1327#false} is VALID [2022-04-27 11:09:16,455 INFO L272 TraceCheckUtils]: 15: Hoare triple {1327#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1327#false} is VALID [2022-04-27 11:09:16,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {1327#false} ~cond := #in~cond; {1327#false} is VALID [2022-04-27 11:09:16,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {1327#false} assume 0 == ~cond; {1327#false} is VALID [2022-04-27 11:09:16,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-04-27 11:09:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:16,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447708452] [2022-04-27 11:09:16,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447708452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:16,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929967468] [2022-04-27 11:09:16,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:09:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:16,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:16,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:09:16,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:09:16,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:16,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:09:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:16,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:16,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} call ULTIMATE.init(); {1326#true} is VALID [2022-04-27 11:09:16,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#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); {1326#true} is VALID [2022-04-27 11:09:16,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 11:09:16,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} #61#return; {1326#true} is VALID [2022-04-27 11:09:16,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} call #t~ret11 := main(); {1326#true} is VALID [2022-04-27 11:09:16,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1331#(= main_~y~0 0)} is VALID [2022-04-27 11:09:16,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {1331#(= 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; {1332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:16,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(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; {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1366#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {1366#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1370#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:16,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {1370#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:16,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {1333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:16,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {1327#false} is VALID [2022-04-27 11:09:16,716 INFO L272 TraceCheckUtils]: 15: Hoare triple {1327#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1327#false} is VALID [2022-04-27 11:09:16,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {1327#false} ~cond := #in~cond; {1327#false} is VALID [2022-04-27 11:09:16,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {1327#false} assume 0 == ~cond; {1327#false} is VALID [2022-04-27 11:09:16,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-04-27 11:09:16,716 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-27 11:09:16,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:16,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-04-27 11:09:16,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {1327#false} assume 0 == ~cond; {1327#false} is VALID [2022-04-27 11:09:16,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {1327#false} ~cond := #in~cond; {1327#false} is VALID [2022-04-27 11:09:16,816 INFO L272 TraceCheckUtils]: 15: Hoare triple {1327#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1327#false} is VALID [2022-04-27 11:09:16,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {1407#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1327#false} is VALID [2022-04-27 11:09:16,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {1411#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1407#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:16,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1411#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1411#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:16,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {1418#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1411#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:16,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {1422#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1418#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:09:16,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {1326#true} ~z~0 := ~y~0; {1422#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:16,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1326#true} assume !(~x~0 % 4294967296 > 0); {1326#true} is VALID [2022-04-27 11:09:16,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {1326#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1326#true} is VALID [2022-04-27 11:09:16,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1326#true} is VALID [2022-04-27 11:09:16,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1326#true} is VALID [2022-04-27 11:09:16,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} call #t~ret11 := main(); {1326#true} is VALID [2022-04-27 11:09:16,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} #61#return; {1326#true} is VALID [2022-04-27 11:09:16,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 11:09:16,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#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); {1326#true} is VALID [2022-04-27 11:09:16,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} call ULTIMATE.init(); {1326#true} is VALID [2022-04-27 11:09:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:16,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929967468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:16,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:16,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-04-27 11:09:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315677515] [2022-04-27 11:09:16,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 11:09:16,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:16,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:16,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:16,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:09:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:16,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:09:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:09:16,850 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:17,261 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 11:09:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:09:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 11:09:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 54 transitions. [2022-04-27 11:09:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 54 transitions. [2022-04-27 11:09:17,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 54 transitions. [2022-04-27 11:09:17,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:17,308 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:09:17,308 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 11:09:17,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:09:17,309 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:17,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 39 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:09:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 11:09:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-04-27 11:09:17,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:17,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,335 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,335 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:17,336 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 11:09:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 11:09:17,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:17,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:17,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-27 11:09:17,337 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-27 11:09:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:17,338 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 11:09:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 11:09:17,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:17,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:17,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:17,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-27 11:09:17,339 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 19 [2022-04-27 11:09:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:17,339 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-27 11:09:17,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 11:09:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:09:17,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:17,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:17,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:17,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:17,554 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 4 times [2022-04-27 11:09:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:17,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794834743] [2022-04-27 11:09:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:17,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {1692#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1682#true} is VALID [2022-04-27 11:09:17,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {1682#true} assume true; {1682#true} is VALID [2022-04-27 11:09:17,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1682#true} {1682#true} #61#return; {1682#true} is VALID [2022-04-27 11:09:17,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {1682#true} call ULTIMATE.init(); {1692#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:17,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1682#true} is VALID [2022-04-27 11:09:17,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1682#true} assume true; {1682#true} is VALID [2022-04-27 11:09:17,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1682#true} {1682#true} #61#return; {1682#true} is VALID [2022-04-27 11:09:17,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {1682#true} call #t~ret11 := main(); {1682#true} is VALID [2022-04-27 11:09:17,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1682#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1682#true} is VALID [2022-04-27 11:09:17,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {1682#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1682#true} is VALID [2022-04-27 11:09:17,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {1682#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1682#true} is VALID [2022-04-27 11:09:17,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1682#true} assume !(~x~0 % 4294967296 > 0); {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:17,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:17,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:17,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:17,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,645 INFO L272 TraceCheckUtils]: 16: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1690#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:17,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {1690#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1691#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:17,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {1691#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1683#false} is VALID [2022-04-27 11:09:17,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {1683#false} assume !false; {1683#false} is VALID [2022-04-27 11:09:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:17,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:17,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794834743] [2022-04-27 11:09:17,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794834743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:17,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021673603] [2022-04-27 11:09:17,646 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:09:17,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:17,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:17,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:09:17,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:09:17,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:17,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:09:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:17,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:17,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {1682#true} call ULTIMATE.init(); {1682#true} is VALID [2022-04-27 11:09:17,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {1682#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); {1682#true} is VALID [2022-04-27 11:09:17,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1682#true} assume true; {1682#true} is VALID [2022-04-27 11:09:17,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1682#true} {1682#true} #61#return; {1682#true} is VALID [2022-04-27 11:09:17,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {1682#true} call #t~ret11 := main(); {1682#true} is VALID [2022-04-27 11:09:17,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1682#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1682#true} is VALID [2022-04-27 11:09:17,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {1682#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1682#true} is VALID [2022-04-27 11:09:17,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {1682#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1682#true} is VALID [2022-04-27 11:09:17,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1682#true} assume !(~x~0 % 4294967296 > 0); {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:17,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:17,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:17,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:17,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:17,871 INFO L272 TraceCheckUtils]: 16: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:17,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {1744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:17,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1683#false} is VALID [2022-04-27 11:09:17,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {1683#false} assume !false; {1683#false} is VALID [2022-04-27 11:09:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:17,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:18,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {1683#false} assume !false; {1683#false} is VALID [2022-04-27 11:09:18,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {1748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1683#false} is VALID [2022-04-27 11:09:18,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {1744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:18,091 INFO L272 TraceCheckUtils]: 16: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:18,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:18,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:18,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:18,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:18,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1689#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:18,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1688#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:18,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:18,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {1682#true} assume !(~x~0 % 4294967296 > 0); {1687#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:18,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {1682#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {1682#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {1682#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {1682#true} call #t~ret11 := main(); {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1682#true} {1682#true} #61#return; {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {1682#true} assume true; {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {1682#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); {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {1682#true} call ULTIMATE.init(); {1682#true} is VALID [2022-04-27 11:09:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:18,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021673603] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:18,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:18,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-27 11:09:18,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764272660] [2022-04-27 11:09:18,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:09:18,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:18,103 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), 7 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:18,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:18,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:09:18,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:09:18,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:09:18,124 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:18,357 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-27 11:09:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:09:18,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 11:09:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-27 11:09:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-27 11:09:18,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-04-27 11:09:18,382 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-27 11:09:18,383 INFO L225 Difference]: With dead ends: 42 [2022-04-27 11:09:18,383 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:09:18,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:09:18,383 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:18,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:09:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:09:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 11:09:18,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:18,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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-27 11:09:18,415 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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-27 11:09:18,415 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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-27 11:09:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:18,416 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 11:09:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-27 11:09:18,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:18,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:18,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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 34 states. [2022-04-27 11:09:18,416 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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 34 states. [2022-04-27 11:09:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:18,417 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 11:09:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-27 11:09:18,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:18,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:18,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:18,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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-27 11:09:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-27 11:09:18,418 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2022-04-27 11:09:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:18,418 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-27 11:09:18,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 11:09:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 11:09:18,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:18,419 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:18,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:18,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:18,631 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1178216785, now seen corresponding path program 5 times [2022-04-27 11:09:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:18,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142821277] [2022-04-27 11:09:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:18,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:18,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {2015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2004#true} is VALID [2022-04-27 11:09:18,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {2004#true} assume true; {2004#true} is VALID [2022-04-27 11:09:18,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2004#true} {2004#true} #61#return; {2004#true} is VALID [2022-04-27 11:09:18,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {2004#true} call ULTIMATE.init(); {2015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:18,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {2015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2004#true} is VALID [2022-04-27 11:09:18,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {2004#true} assume true; {2004#true} is VALID [2022-04-27 11:09:18,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2004#true} {2004#true} #61#return; {2004#true} is VALID [2022-04-27 11:09:18,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {2004#true} call #t~ret11 := main(); {2004#true} is VALID [2022-04-27 11:09:18,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {2004#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2009#(= main_~y~0 0)} is VALID [2022-04-27 11:09:18,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {2009#(= 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; {2010#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:18,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#(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; {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:18,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:18,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2012#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:18,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2012#(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; {2013#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:18,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {2013#(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; {2014#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:09:18,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {2014#(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; {2005#false} is VALID [2022-04-27 11:09:18,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {2005#false} assume !(~z~0 % 4294967296 > 0); {2005#false} is VALID [2022-04-27 11:09:18,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {2005#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2005#false} is VALID [2022-04-27 11:09:18,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {2005#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2005#false} is VALID [2022-04-27 11:09:18,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {2005#false} assume !(~y~0 % 4294967296 > 0); {2005#false} is VALID [2022-04-27 11:09:18,725 INFO L272 TraceCheckUtils]: 17: Hoare triple {2005#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2005#false} is VALID [2022-04-27 11:09:18,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#false} ~cond := #in~cond; {2005#false} is VALID [2022-04-27 11:09:18,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#false} assume 0 == ~cond; {2005#false} is VALID [2022-04-27 11:09:18,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {2005#false} assume !false; {2005#false} is VALID [2022-04-27 11:09:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:18,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:18,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142821277] [2022-04-27 11:09:18,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142821277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:18,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845518413] [2022-04-27 11:09:18,725 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:09:18,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:18,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:18,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:18,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 11:09:18,776 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-27 11:09:18,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:18,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:09:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:18,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:18,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {2004#true} call ULTIMATE.init(); {2004#true} is VALID [2022-04-27 11:09:18,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {2004#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); {2004#true} is VALID [2022-04-27 11:09:18,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {2004#true} assume true; {2004#true} is VALID [2022-04-27 11:09:18,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2004#true} {2004#true} #61#return; {2004#true} is VALID [2022-04-27 11:09:18,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {2004#true} call #t~ret11 := main(); {2004#true} is VALID [2022-04-27 11:09:18,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {2004#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2009#(= main_~y~0 0)} is VALID [2022-04-27 11:09:18,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {2009#(= 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; {2010#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:18,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {2010#(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; {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:18,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:18,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {2011#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2046#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:18,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {2046#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2050#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:18,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {2050#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2054#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:09:18,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {2054#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2005#false} is VALID [2022-04-27 11:09:18,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {2005#false} assume !(~z~0 % 4294967296 > 0); {2005#false} is VALID [2022-04-27 11:09:18,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {2005#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2005#false} is VALID [2022-04-27 11:09:18,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {2005#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2005#false} is VALID [2022-04-27 11:09:18,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {2005#false} assume !(~y~0 % 4294967296 > 0); {2005#false} is VALID [2022-04-27 11:09:18,910 INFO L272 TraceCheckUtils]: 17: Hoare triple {2005#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2005#false} is VALID [2022-04-27 11:09:18,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#false} ~cond := #in~cond; {2005#false} is VALID [2022-04-27 11:09:18,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#false} assume 0 == ~cond; {2005#false} is VALID [2022-04-27 11:09:18,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {2005#false} assume !false; {2005#false} is VALID [2022-04-27 11:09:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:18,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:19,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {2005#false} assume !false; {2005#false} is VALID [2022-04-27 11:09:19,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {2005#false} assume 0 == ~cond; {2005#false} is VALID [2022-04-27 11:09:19,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {2005#false} ~cond := #in~cond; {2005#false} is VALID [2022-04-27 11:09:19,057 INFO L272 TraceCheckUtils]: 17: Hoare triple {2005#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2005#false} is VALID [2022-04-27 11:09:19,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {2094#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2005#false} is VALID [2022-04-27 11:09:19,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {2098#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2094#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:19,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2098#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:19,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {2102#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2102#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:09:19,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {2109#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2102#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:09:19,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2113#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2109#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:09:19,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {2117#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2113#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:19,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2004#true} ~z~0 := ~y~0; {2117#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:09:19,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {2004#true} assume !(~x~0 % 4294967296 > 0); {2004#true} is VALID [2022-04-27 11:09:19,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {2004#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2004#true} is VALID [2022-04-27 11:09:19,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {2004#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2004#true} is VALID [2022-04-27 11:09:19,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {2004#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2004#true} is VALID [2022-04-27 11:09:19,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {2004#true} call #t~ret11 := main(); {2004#true} is VALID [2022-04-27 11:09:19,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2004#true} {2004#true} #61#return; {2004#true} is VALID [2022-04-27 11:09:19,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {2004#true} assume true; {2004#true} is VALID [2022-04-27 11:09:19,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {2004#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); {2004#true} is VALID [2022-04-27 11:09:19,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {2004#true} call ULTIMATE.init(); {2004#true} is VALID [2022-04-27 11:09:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:09:19,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845518413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:19,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:19,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-27 11:09:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829169568] [2022-04-27 11:09:19,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:19,063 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (4), 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 21 [2022-04-27 11:09:19,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:19,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:19,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:09:19,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:19,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:09:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:09:19,090 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:19,774 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-27 11:09:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:09:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (4), 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 21 [2022-04-27 11:09:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-27 11:09:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-27 11:09:19,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 58 transitions. [2022-04-27 11:09:19,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:19,856 INFO L225 Difference]: With dead ends: 66 [2022-04-27 11:09:19,856 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 11:09:19,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:09:19,857 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:19,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 52 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:09:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 11:09:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 23. [2022-04-27 11:09:19,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:19,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,886 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,886 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:19,887 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-27 11:09:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-27 11:09:19,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:19,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:19,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-27 11:09:19,887 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-27 11:09:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:19,888 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-27 11:09:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-27 11:09:19,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:19,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:19,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:19,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 11:09:19,889 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-04-27 11:09:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:19,889 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 11:09:19,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 11:09:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:09:19,890 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:19,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:19,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:20,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:20,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 6 times [2022-04-27 11:09:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432979339] [2022-04-27 11:09:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:20,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2425#true} is VALID [2022-04-27 11:09:20,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-27 11:09:20,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2425#true} {2425#true} #61#return; {2425#true} is VALID [2022-04-27 11:09:20,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:20,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2425#true} is VALID [2022-04-27 11:09:20,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-27 11:09:20,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #61#return; {2425#true} is VALID [2022-04-27 11:09:20,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret11 := main(); {2425#true} is VALID [2022-04-27 11:09:20,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2430#(= main_~y~0 0)} is VALID [2022-04-27 11:09:20,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {2430#(= 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; {2431#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:20,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {2431#(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; {2432#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:20,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {2432#(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; {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:20,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:20,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2434#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:20,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {2434#(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; {2435#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:20,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {2435#(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; {2436#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {2436#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {2426#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {2426#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {2426#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {2426#false} assume !(~y~0 % 4294967296 > 0); {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L272 TraceCheckUtils]: 18: Hoare triple {2426#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {2426#false} ~cond := #in~cond; {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {2426#false} assume 0 == ~cond; {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-27 11:09:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:20,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432979339] [2022-04-27 11:09:20,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432979339] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418191836] [2022-04-27 11:09:20,214 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:09:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:20,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:20,215 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:20,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 11:09:20,247 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:09:20,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:20,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:09:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:20,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:20,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2022-04-27 11:09:20,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#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); {2425#true} is VALID [2022-04-27 11:09:20,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-27 11:09:20,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #61#return; {2425#true} is VALID [2022-04-27 11:09:20,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret11 := main(); {2425#true} is VALID [2022-04-27 11:09:20,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2430#(= main_~y~0 0)} is VALID [2022-04-27 11:09:20,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {2430#(= 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; {2431#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:20,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {2431#(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; {2432#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:20,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {2432#(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; {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:20,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:20,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {2433#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2471#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:20,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {2471#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2475#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:20,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {2475#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2479#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:20,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2426#false} is VALID [2022-04-27 11:09:20,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {2426#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2426#false} is VALID [2022-04-27 11:09:20,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {2426#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2426#false} is VALID [2022-04-27 11:09:20,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {2426#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2426#false} is VALID [2022-04-27 11:09:20,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {2426#false} assume !(~y~0 % 4294967296 > 0); {2426#false} is VALID [2022-04-27 11:09:20,380 INFO L272 TraceCheckUtils]: 18: Hoare triple {2426#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2426#false} is VALID [2022-04-27 11:09:20,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {2426#false} ~cond := #in~cond; {2426#false} is VALID [2022-04-27 11:09:20,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {2426#false} assume 0 == ~cond; {2426#false} is VALID [2022-04-27 11:09:20,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-27 11:09:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:20,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:20,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-27 11:09:20,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {2426#false} assume 0 == ~cond; {2426#false} is VALID [2022-04-27 11:09:20,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {2426#false} ~cond := #in~cond; {2426#false} is VALID [2022-04-27 11:09:20,525 INFO L272 TraceCheckUtils]: 18: Hoare triple {2426#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2426#false} is VALID [2022-04-27 11:09:20,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {2426#false} assume !(~y~0 % 4294967296 > 0); {2426#false} is VALID [2022-04-27 11:09:20,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {2522#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2426#false} is VALID [2022-04-27 11:09:20,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {2526#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2522#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:20,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {2530#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2526#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:20,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2530#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:20,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {2538#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2534#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:09:20,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {2542#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2538#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {2425#true} ~z~0 := ~y~0; {2542#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#true} assume !(~x~0 % 4294967296 > 0); {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {2425#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {2425#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {2425#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret11 := main(); {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #61#return; {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#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); {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2425#true} is VALID [2022-04-27 11:09:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:20,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418191836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:20,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:20,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-27 11:09:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235163633] [2022-04-27 11:09:20,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:09:20,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:20,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:20,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:20,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:09:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:09:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:09:20,556 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:21,288 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-27 11:09:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 11:09:21,288 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:09:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-27 11:09:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-27 11:09:21,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 55 transitions. [2022-04-27 11:09:21,350 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-27 11:09:21,350 INFO L225 Difference]: With dead ends: 50 [2022-04-27 11:09:21,350 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:09:21,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:09:21,351 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:21,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:09:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:09:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-27 11:09:21,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:21,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,414 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,415 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:21,416 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-27 11:09:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-27 11:09:21,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:21,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:21,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states 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-27 11:09:21,416 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states 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-27 11:09:21,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:21,417 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-27 11:09:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-27 11:09:21,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:21,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:21,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:21,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-27 11:09:21,418 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2022-04-27 11:09:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:21,418 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-27 11:09:21,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-27 11:09:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:09:21,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:21,418 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:21,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:21,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 11:09:21,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 7 times [2022-04-27 11:09:21,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:21,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182199250] [2022-04-27 11:09:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:21,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {2837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2826#true} is VALID [2022-04-27 11:09:21,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-27 11:09:21,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2826#true} {2826#true} #61#return; {2826#true} is VALID [2022-04-27 11:09:21,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:21,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2826#true} is VALID [2022-04-27 11:09:21,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-27 11:09:21,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #61#return; {2826#true} is VALID [2022-04-27 11:09:21,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret11 := main(); {2826#true} is VALID [2022-04-27 11:09:21,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2826#true} is VALID [2022-04-27 11:09:21,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:21,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:21,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:21,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#true} assume !(~x~0 % 4294967296 > 0); {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:21,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:21,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,751 INFO L272 TraceCheckUtils]: 19: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:21,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {2835#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2836#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:21,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {2836#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2827#false} is VALID [2022-04-27 11:09:21,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2022-04-27 11:09:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:21,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:21,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182199250] [2022-04-27 11:09:21,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182199250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:21,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867658677] [2022-04-27 11:09:21,752 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:09:21,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:21,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:21,753 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:21,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 11:09:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:21,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:09:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:21,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:21,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2022-04-27 11:09:21,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#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); {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #61#return; {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret11 := main(); {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {2826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:21,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#true} assume !(~x~0 % 4294967296 > 0); {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:21,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:21,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:21,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:21,984 INFO L272 TraceCheckUtils]: 19: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2898#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:21,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {2898#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2902#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:21,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {2902#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2827#false} is VALID [2022-04-27 11:09:21,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2022-04-27 11:09:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:21,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:22,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {2827#false} assume !false; {2827#false} is VALID [2022-04-27 11:09:22,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {2902#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2827#false} is VALID [2022-04-27 11:09:22,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {2898#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2902#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:22,092 INFO L272 TraceCheckUtils]: 19: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2898#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:22,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:22,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:22,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:22,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:22,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:22,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2834#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:22,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2833#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:22,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2832#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:22,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:22,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#true} assume !(~x~0 % 4294967296 > 0); {2831#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:22,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:22,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:22,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {2826#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2826#true} is VALID [2022-04-27 11:09:22,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {2826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2826#true} is VALID [2022-04-27 11:09:22,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {2826#true} call #t~ret11 := main(); {2826#true} is VALID [2022-04-27 11:09:22,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2826#true} {2826#true} #61#return; {2826#true} is VALID [2022-04-27 11:09:22,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume true; {2826#true} is VALID [2022-04-27 11:09:22,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#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); {2826#true} is VALID [2022-04-27 11:09:22,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {2826#true} call ULTIMATE.init(); {2826#true} is VALID [2022-04-27 11:09:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:09:22,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867658677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:22,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:22,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-27 11:09:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610491460] [2022-04-27 11:09:22,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:22,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:09:22,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:22,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:22,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:09:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:09:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:09:22,117 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:22,489 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-27 11:09:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:09:22,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:09:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-04-27 11:09:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-04-27 11:09:22,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2022-04-27 11:09:22,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:22,518 INFO L225 Difference]: With dead ends: 51 [2022-04-27 11:09:22,518 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 11:09:22,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:09:22,518 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:22,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 51 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:09:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 11:09:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-04-27 11:09:22,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:22,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,580 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,580 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:22,581 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 11:09:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 11:09:22,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:22,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:22,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-27 11:09:22,582 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-27 11:09:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:22,582 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-27 11:09:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 11:09:22,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:22,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:22,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:22,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-04-27 11:09:22,583 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-04-27 11:09:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:22,583 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-04-27 11:09:22,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 11:09:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:09:22,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:22,585 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:22,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:22,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:22,801 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:22,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 8 times [2022-04-27 11:09:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:22,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484478506] [2022-04-27 11:09:22,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:22,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {3225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3211#true} is VALID [2022-04-27 11:09:22,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-27 11:09:22,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3211#true} {3211#true} #61#return; {3211#true} is VALID [2022-04-27 11:09:22,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {3211#true} call ULTIMATE.init(); {3225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:22,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {3225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3211#true} is VALID [2022-04-27 11:09:22,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-27 11:09:22,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3211#true} {3211#true} #61#return; {3211#true} is VALID [2022-04-27 11:09:22,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {3211#true} call #t~ret11 := main(); {3211#true} is VALID [2022-04-27 11:09:22,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {3211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3216#(= main_~y~0 0)} is VALID [2022-04-27 11:09:22,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {3216#(= 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; {3217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:22,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {3217#(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; {3218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:22,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {3218#(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; {3219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:22,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {3219#(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; {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:22,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:22,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3221#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:22,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {3221#(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; {3222#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:22,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {3222#(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; {3223#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {3223#(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; {3224#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {3224#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {3212#false} assume !(~y~0 % 4294967296 > 0); {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L272 TraceCheckUtils]: 21: Hoare triple {3212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {3212#false} ~cond := #in~cond; {3212#false} is VALID [2022-04-27 11:09:22,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {3212#false} assume 0 == ~cond; {3212#false} is VALID [2022-04-27 11:09:22,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {3212#false} assume !false; {3212#false} is VALID [2022-04-27 11:09:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:22,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484478506] [2022-04-27 11:09:22,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484478506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284587730] [2022-04-27 11:09:22,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:09:22,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:22,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:22,973 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:22,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 11:09:23,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:09:23,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:23,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:09:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:23,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:23,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {3211#true} call ULTIMATE.init(); {3211#true} is VALID [2022-04-27 11:09:23,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {3211#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); {3211#true} is VALID [2022-04-27 11:09:23,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-27 11:09:23,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3211#true} {3211#true} #61#return; {3211#true} is VALID [2022-04-27 11:09:23,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {3211#true} call #t~ret11 := main(); {3211#true} is VALID [2022-04-27 11:09:23,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {3211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3216#(= main_~y~0 0)} is VALID [2022-04-27 11:09:23,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {3216#(= 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; {3217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:23,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {3217#(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; {3218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:23,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {3218#(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; {3219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:23,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3219#(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; {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:23,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:23,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {3220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3262#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:23,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {3262#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3266#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:23,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {3266#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3270#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:23,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {3270#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3274#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {3274#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {3212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {3212#false} assume !(~y~0 % 4294967296 > 0); {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L272 TraceCheckUtils]: 21: Hoare triple {3212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {3212#false} ~cond := #in~cond; {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {3212#false} assume 0 == ~cond; {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {3212#false} assume !false; {3212#false} is VALID [2022-04-27 11:09:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:23,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:23,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {3212#false} assume !false; {3212#false} is VALID [2022-04-27 11:09:23,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {3212#false} assume 0 == ~cond; {3212#false} is VALID [2022-04-27 11:09:23,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {3212#false} ~cond := #in~cond; {3212#false} is VALID [2022-04-27 11:09:23,372 INFO L272 TraceCheckUtils]: 21: Hoare triple {3212#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3212#false} is VALID [2022-04-27 11:09:23,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {3212#false} assume !(~y~0 % 4294967296 > 0); {3212#false} is VALID [2022-04-27 11:09:23,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {3320#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3212#false} is VALID [2022-04-27 11:09:23,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {3324#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3320#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:23,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {3328#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3324#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:23,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {3332#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3328#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:23,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {3336#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3332#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:23,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {3340#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3336#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:09:23,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {3344#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3340#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {3348#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3344#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {3211#true} ~z~0 := ~y~0; {3348#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {3211#true} assume !(~x~0 % 4294967296 > 0); {3211#true} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {3211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3211#true} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {3211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3211#true} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {3211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3211#true} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {3211#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3211#true} is VALID [2022-04-27 11:09:23,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {3211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3211#true} is VALID [2022-04-27 11:09:23,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {3211#true} call #t~ret11 := main(); {3211#true} is VALID [2022-04-27 11:09:23,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3211#true} {3211#true} #61#return; {3211#true} is VALID [2022-04-27 11:09:23,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-27 11:09:23,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {3211#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); {3211#true} is VALID [2022-04-27 11:09:23,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {3211#true} call ULTIMATE.init(); {3211#true} is VALID [2022-04-27 11:09:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:23,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284587730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:23,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:23,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-27 11:09:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763727902] [2022-04-27 11:09:23,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:23,379 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:09:23,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:23,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:23,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:23,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 11:09:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 11:09:23,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:09:23,415 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:24,846 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2022-04-27 11:09:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-27 11:09:24,846 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 11:09:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-27 11:09:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-27 11:09:24,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-27 11:09:24,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:24,934 INFO L225 Difference]: With dead ends: 69 [2022-04-27 11:09:24,934 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 11:09:24,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=347, Invalid=2005, Unknown=0, NotChecked=0, Total=2352 [2022-04-27 11:09:24,935 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:24,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 65 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:09:24,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 11:09:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2022-04-27 11:09:25,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:25,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:25,057 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:25,057 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:25,058 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-04-27 11:09:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-27 11:09:25,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:25,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:25,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 11:09:25,058 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-27 11:09:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:25,059 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-04-27 11:09:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-27 11:09:25,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:25,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:25,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:25,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-27 11:09:25,060 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 25 [2022-04-27 11:09:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:25,060 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-27 11:09:25,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 23 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 11:09:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:09:25,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:25,061 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:25,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:25,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 11:09:25,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:25,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1196529023, now seen corresponding path program 9 times [2022-04-27 11:09:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:25,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004991262] [2022-04-27 11:09:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:25,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {3753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3740#true} is VALID [2022-04-27 11:09:25,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-27 11:09:25,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3740#true} {3740#true} #61#return; {3740#true} is VALID [2022-04-27 11:09:25,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {3740#true} call ULTIMATE.init(); {3753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:25,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {3753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3740#true} is VALID [2022-04-27 11:09:25,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-27 11:09:25,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3740#true} {3740#true} #61#return; {3740#true} is VALID [2022-04-27 11:09:25,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {3740#true} call #t~ret11 := main(); {3740#true} is VALID [2022-04-27 11:09:25,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {3740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3745#(= main_~y~0 0)} is VALID [2022-04-27 11:09:25,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {3745#(= 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; {3746#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:25,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {3746#(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; {3747#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:25,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {3747#(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; {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:25,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:25,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3749#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:25,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {3749#(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; {3750#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:25,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {3750#(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; {3751#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:25,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {3751#(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; {3752#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {3752#(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; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {3741#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; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {3741#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; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {3741#false} assume !(~z~0 % 4294967296 > 0); {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {3741#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {3741#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {3741#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {3741#false} assume !(~y~0 % 4294967296 > 0); {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L272 TraceCheckUtils]: 22: Hoare triple {3741#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {3741#false} ~cond := #in~cond; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {3741#false} assume 0 == ~cond; {3741#false} is VALID [2022-04-27 11:09:25,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {3741#false} assume !false; {3741#false} is VALID [2022-04-27 11:09:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:09:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:25,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004991262] [2022-04-27 11:09:25,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004991262] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:25,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754437660] [2022-04-27 11:09:25,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:09:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:25,404 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:25,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 11:09:25,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 11:09:25,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:25,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:09:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:25,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:25,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {3740#true} call ULTIMATE.init(); {3740#true} is VALID [2022-04-27 11:09:25,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {3740#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); {3740#true} is VALID [2022-04-27 11:09:25,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-27 11:09:25,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3740#true} {3740#true} #61#return; {3740#true} is VALID [2022-04-27 11:09:25,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {3740#true} call #t~ret11 := main(); {3740#true} is VALID [2022-04-27 11:09:25,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {3740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3745#(= main_~y~0 0)} is VALID [2022-04-27 11:09:25,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {3745#(= 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; {3746#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:25,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {3746#(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; {3747#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:25,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {3747#(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; {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:25,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:25,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {3748#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3787#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:25,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {3787#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3791#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:25,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {3791#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3795#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {3795#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3799#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {3799#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3741#false} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {3741#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; {3741#false} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {3741#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; {3741#false} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {3741#false} assume !(~z~0 % 4294967296 > 0); {3741#false} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {3741#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3741#false} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {3741#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3741#false} is VALID [2022-04-27 11:09:25,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {3741#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3741#false} is VALID [2022-04-27 11:09:25,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {3741#false} assume !(~y~0 % 4294967296 > 0); {3741#false} is VALID [2022-04-27 11:09:25,612 INFO L272 TraceCheckUtils]: 22: Hoare triple {3741#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3741#false} is VALID [2022-04-27 11:09:25,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {3741#false} ~cond := #in~cond; {3741#false} is VALID [2022-04-27 11:09:25,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {3741#false} assume 0 == ~cond; {3741#false} is VALID [2022-04-27 11:09:25,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {3741#false} assume !false; {3741#false} is VALID [2022-04-27 11:09:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:09:25,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:25,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {3741#false} assume !false; {3741#false} is VALID [2022-04-27 11:09:25,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {3741#false} assume 0 == ~cond; {3741#false} is VALID [2022-04-27 11:09:25,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {3741#false} ~cond := #in~cond; {3741#false} is VALID [2022-04-27 11:09:25,848 INFO L272 TraceCheckUtils]: 22: Hoare triple {3741#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3741#false} is VALID [2022-04-27 11:09:25,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {3848#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3741#false} is VALID [2022-04-27 11:09:25,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {3852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3848#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:25,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {3856#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3852#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:25,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3856#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:09:25,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:25,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:25,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:25,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {3873#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3860#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:25,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {3877#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3873#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:25,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {3881#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3877#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:25,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {3885#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3881#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:25,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {3740#true} ~z~0 := ~y~0; {3885#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:25,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {3740#true} assume !(~x~0 % 4294967296 > 0); {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {3740#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {3740#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {3740#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {3740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {3740#true} call #t~ret11 := main(); {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3740#true} {3740#true} #61#return; {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {3740#true} assume true; {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {3740#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); {3740#true} is VALID [2022-04-27 11:09:25,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {3740#true} call ULTIMATE.init(); {3740#true} is VALID [2022-04-27 11:09:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 11:09:25,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754437660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:25,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:25,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-27 11:09:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702408000] [2022-04-27 11:09:25,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:25,863 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:09:25,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:25,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:25,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:25,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 11:09:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 11:09:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:09:25,902 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:27,157 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-04-27 11:09:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 11:09:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:09:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 68 transitions. [2022-04-27 11:09:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 68 transitions. [2022-04-27 11:09:27,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 68 transitions. [2022-04-27 11:09:27,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:27,264 INFO L225 Difference]: With dead ends: 85 [2022-04-27 11:09:27,265 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 11:09:27,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1614, Unknown=0, NotChecked=0, Total=1980 [2022-04-27 11:09:27,266 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:27,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 77 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:09:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 11:09:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2022-04-27 11:09:27,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:27,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,355 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,355 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:27,356 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-04-27 11:09:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-27 11:09:27,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:27,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:27,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 11:09:27,356 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 11:09:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:27,357 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-04-27 11:09:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-27 11:09:27,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:27,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:27,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:27,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-27 11:09:27,358 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 26 [2022-04-27 11:09:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:27,358 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-27 11:09:27,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 22 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 11:09:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:09:27,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:27,359 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:27,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:27,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 11:09:27,564 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 10 times [2022-04-27 11:09:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:27,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672577882] [2022-04-27 11:09:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:27,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:27,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {4323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4311#true} {4311#true} #61#return; {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:27,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {4323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #61#return; {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret11 := main(); {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {4311#true} assume !(~x~0 % 4294967296 > 0); {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:27,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:27,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,687 INFO L272 TraceCheckUtils]: 22: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4321#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:27,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {4321#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4322#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:27,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {4322#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4312#false} is VALID [2022-04-27 11:09:27,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-27 11:09:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672577882] [2022-04-27 11:09:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672577882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857328972] [2022-04-27 11:09:27,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:09:27,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:27,689 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:27,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 11:09:27,725 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:09:27,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:27,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 11:09:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:27,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:27,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-27 11:09:27,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#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); {4311#true} is VALID [2022-04-27 11:09:27,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-27 11:09:27,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #61#return; {4311#true} is VALID [2022-04-27 11:09:27,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret11 := main(); {4311#true} is VALID [2022-04-27 11:09:27,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4311#true} is VALID [2022-04-27 11:09:27,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:27,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {4311#true} assume !(~x~0 % 4294967296 > 0); {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:27,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:27,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:27,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:27,974 INFO L272 TraceCheckUtils]: 22: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:27,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {4393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:27,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {4397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4312#false} is VALID [2022-04-27 11:09:27,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-27 11:09:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:27,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:28,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {4312#false} assume !false; {4312#false} is VALID [2022-04-27 11:09:28,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {4397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4312#false} is VALID [2022-04-27 11:09:28,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {4393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:28,213 INFO L272 TraceCheckUtils]: 22: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:28,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:28,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:28,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:28,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:28,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:28,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:28,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4320#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:28,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4319#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:28,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4318#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:28,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4317#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:28,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {4311#true} assume !(~x~0 % 4294967296 > 0); {4316#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {4311#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {4311#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {4311#true} call #t~ret11 := main(); {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4311#true} {4311#true} #61#return; {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {4311#true} assume true; {4311#true} is VALID [2022-04-27 11:09:28,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {4311#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); {4311#true} is VALID [2022-04-27 11:09:28,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {4311#true} call ULTIMATE.init(); {4311#true} is VALID [2022-04-27 11:09:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:28,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857328972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:28,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:28,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-27 11:09:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963254301] [2022-04-27 11:09:28,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:28,222 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:09:28,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:28,222 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:28,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:28,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:09:28,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:09:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:09:28,258 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:28,689 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-04-27 11:09:28,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:09:28,689 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 11:09:28,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:28,689 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-27 11:09:28,690 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-27 11:09:28,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-27 11:09:28,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:28,718 INFO L225 Difference]: With dead ends: 59 [2022-04-27 11:09:28,718 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 11:09:28,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:09:28,719 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:28,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:09:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 11:09:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-04-27 11:09:28,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:28,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 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-27 11:09:28,814 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 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-27 11:09:28,814 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 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-27 11:09:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:28,815 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-27 11:09:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-27 11:09:28,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:28,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:28,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 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 49 states. [2022-04-27 11:09:28,815 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 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 49 states. [2022-04-27 11:09:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:28,816 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-27 11:09:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-27 11:09:28,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:28,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:28,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:28,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.15) internal successors, (46), 40 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-27 11:09:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-27 11:09:28,817 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 26 [2022-04-27 11:09:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:28,817 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-27 11:09:28,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-27 11:09:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:09:28,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:28,818 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:28,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:29,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 11:09:29,027 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 11 times [2022-04-27 11:09:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:29,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794494425] [2022-04-27 11:09:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:29,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:29,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:29,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {4769#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4753#true} is VALID [2022-04-27 11:09:29,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {4753#true} assume true; {4753#true} is VALID [2022-04-27 11:09:29,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4753#true} {4753#true} #61#return; {4753#true} is VALID [2022-04-27 11:09:29,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {4753#true} call ULTIMATE.init(); {4769#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:29,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4753#true} is VALID [2022-04-27 11:09:29,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {4753#true} assume true; {4753#true} is VALID [2022-04-27 11:09:29,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4753#true} {4753#true} #61#return; {4753#true} is VALID [2022-04-27 11:09:29,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {4753#true} call #t~ret11 := main(); {4753#true} is VALID [2022-04-27 11:09:29,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {4753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4758#(= main_~y~0 0)} is VALID [2022-04-27 11:09:29,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {4758#(= 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; {4759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:29,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {4759#(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; {4760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:29,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {4760#(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; {4761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:29,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {4761#(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; {4762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:29,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {4762#(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; {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4764#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:29,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {4764#(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; {4765#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:29,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {4765#(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; {4766#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:29,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {4766#(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; {4767#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:29,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {4767#(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; {4768#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {4768#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {4754#false} assume !(~y~0 % 4294967296 > 0); {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L272 TraceCheckUtils]: 24: Hoare triple {4754#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {4754#false} ~cond := #in~cond; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {4754#false} assume 0 == ~cond; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {4754#false} assume !false; {4754#false} is VALID [2022-04-27 11:09:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:09:29,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:29,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794494425] [2022-04-27 11:09:29,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794494425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:29,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336781945] [2022-04-27 11:09:29,187 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:09:29,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:29,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:29,193 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:29,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 11:09:29,293 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-27 11:09:29,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:29,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 11:09:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:29,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:29,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {4753#true} call ULTIMATE.init(); {4753#true} is VALID [2022-04-27 11:09:29,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {4753#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); {4753#true} is VALID [2022-04-27 11:09:29,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {4753#true} assume true; {4753#true} is VALID [2022-04-27 11:09:29,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4753#true} {4753#true} #61#return; {4753#true} is VALID [2022-04-27 11:09:29,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {4753#true} call #t~ret11 := main(); {4753#true} is VALID [2022-04-27 11:09:29,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {4753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4758#(= main_~y~0 0)} is VALID [2022-04-27 11:09:29,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {4758#(= 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; {4759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:29,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {4759#(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; {4760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:29,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {4760#(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; {4761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:29,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {4761#(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; {4762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:29,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {4762#(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; {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {4763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4809#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {4809#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4813#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:29,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {4813#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4817#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {4817#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4821#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {4821#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4825#(and (<= 5 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {4825#(and (<= 5 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {4754#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {4754#false} assume !(~y~0 % 4294967296 > 0); {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L272 TraceCheckUtils]: 24: Hoare triple {4754#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {4754#false} ~cond := #in~cond; {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {4754#false} assume 0 == ~cond; {4754#false} is VALID [2022-04-27 11:09:29,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {4754#false} assume !false; {4754#false} is VALID [2022-04-27 11:09:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:09:29,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:29,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {4754#false} assume !false; {4754#false} is VALID [2022-04-27 11:09:29,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {4754#false} assume 0 == ~cond; {4754#false} is VALID [2022-04-27 11:09:29,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {4754#false} ~cond := #in~cond; {4754#false} is VALID [2022-04-27 11:09:29,778 INFO L272 TraceCheckUtils]: 24: Hoare triple {4754#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4754#false} is VALID [2022-04-27 11:09:29,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {4754#false} assume !(~y~0 % 4294967296 > 0); {4754#false} is VALID [2022-04-27 11:09:29,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {4874#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4754#false} is VALID [2022-04-27 11:09:29,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {4878#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4874#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:29,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {4882#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4878#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:29,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {4886#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4882#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:29,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {4890#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4886#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:29,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {4894#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4890#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:29,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {4898#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4894#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:29,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {4902#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4898#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:29,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {4906#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4902#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:29,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {4910#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4906#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {4753#true} ~z~0 := ~y~0; {4910#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {4753#true} assume !(~x~0 % 4294967296 > 0); {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {4753#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {4753#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {4753#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {4753#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {4753#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {4753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {4753#true} call #t~ret11 := main(); {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4753#true} {4753#true} #61#return; {4753#true} is VALID [2022-04-27 11:09:29,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {4753#true} assume true; {4753#true} is VALID [2022-04-27 11:09:29,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {4753#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); {4753#true} is VALID [2022-04-27 11:09:29,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {4753#true} call ULTIMATE.init(); {4753#true} is VALID [2022-04-27 11:09:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:09:29,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336781945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:29,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:29,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 29 [2022-04-27 11:09:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482556824] [2022-04-27 11:09:29,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:09:29,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:29,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:29,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:29,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 11:09:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:29,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 11:09:29,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:09:29,821 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:31,686 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-27 11:09:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-27 11:09:31,686 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 11:09:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2022-04-27 11:09:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 78 transitions. [2022-04-27 11:09:31,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 78 transitions. [2022-04-27 11:09:31,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:31,773 INFO L225 Difference]: With dead ends: 80 [2022-04-27 11:09:31,773 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 11:09:31,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=473, Invalid=3067, Unknown=0, NotChecked=0, Total=3540 [2022-04-27 11:09:31,774 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:31,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:09:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 11:09:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-04-27 11:09:31,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:31,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,940 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,940 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:31,941 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 11:09:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 11:09:31,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:31,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:31,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 11:09:31,942 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 11:09:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:31,942 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 11:09:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 11:09:31,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:31,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:31,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:31,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-04-27 11:09:31,943 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 28 [2022-04-27 11:09:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:31,944 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-04-27 11:09:31,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-27 11:09:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:09:31,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:31,944 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:31,948 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-27 11:09:32,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 11:09:32,145 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 12 times [2022-04-27 11:09:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630633441] [2022-04-27 11:09:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:32,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:32,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {5380#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5367#true} is VALID [2022-04-27 11:09:32,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-04-27 11:09:32,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5367#true} {5367#true} #61#return; {5367#true} is VALID [2022-04-27 11:09:32,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {5367#true} call ULTIMATE.init(); {5380#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:32,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {5380#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5367#true} is VALID [2022-04-27 11:09:32,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5367#true} {5367#true} #61#return; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {5367#true} call #t~ret11 := main(); {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {5367#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#true} assume !(~x~0 % 4294967296 > 0); {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:32,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:32,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:32,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:32,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,281 INFO L272 TraceCheckUtils]: 25: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:32,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {5378#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5379#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:32,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {5379#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5368#false} is VALID [2022-04-27 11:09:32,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2022-04-27 11:09:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:09:32,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630633441] [2022-04-27 11:09:32,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630633441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508127506] [2022-04-27 11:09:32,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:09:32,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:32,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:32,283 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:32,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 11:09:32,319 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-27 11:09:32,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:32,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:09:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:32,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:32,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {5367#true} call ULTIMATE.init(); {5367#true} is VALID [2022-04-27 11:09:32,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {5367#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); {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5367#true} {5367#true} #61#return; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {5367#true} call #t~ret11 := main(); {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {5367#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#true} assume !(~x~0 % 4294967296 > 0); {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:32,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:32,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:32,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:32,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,548 INFO L272 TraceCheckUtils]: 25: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:32,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {5459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:32,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {5463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5368#false} is VALID [2022-04-27 11:09:32,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2022-04-27 11:09:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:09:32,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:32,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {5368#false} assume !false; {5368#false} is VALID [2022-04-27 11:09:32,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {5463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5368#false} is VALID [2022-04-27 11:09:32,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {5459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:32,785 INFO L272 TraceCheckUtils]: 25: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:32,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:32,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:32,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5377#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:32,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5376#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5375#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5374#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:32,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5373#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:32,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#true} assume !(~x~0 % 4294967296 > 0); {5372#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:32,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {5367#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {5367#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {5367#true} call #t~ret11 := main(); {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5367#true} {5367#true} #61#return; {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {5367#true} assume true; {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {5367#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); {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {5367#true} call ULTIMATE.init(); {5367#true} is VALID [2022-04-27 11:09:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:09:32,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508127506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:32,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:32,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-27 11:09:32,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072126416] [2022-04-27 11:09:32,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:32,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:09:32,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:32,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:32,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:32,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:09:32,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:09:32,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:09:32,815 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:33,427 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-04-27 11:09:33,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:09:33,427 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 11:09:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-27 11:09:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-27 11:09:33,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-04-27 11:09:33,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:33,460 INFO L225 Difference]: With dead ends: 77 [2022-04-27 11:09:33,460 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 11:09:33,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:09:33,461 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:33,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:09:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 11:09:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-27 11:09:33,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:33,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,610 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,610 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:33,611 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 11:09:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-27 11:09:33,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:33,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:33,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-27 11:09:33,612 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-27 11:09:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:33,613 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 11:09:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-27 11:09:33,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:33,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:33,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:33,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-04-27 11:09:33,614 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 29 [2022-04-27 11:09:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:33,614 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-04-27 11:09:33,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-04-27 11:09:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:09:33,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:33,614 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:33,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:33,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:33,827 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1616740337, now seen corresponding path program 13 times [2022-04-27 11:09:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:33,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412464710] [2022-04-27 11:09:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:34,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {5946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5928#true} is VALID [2022-04-27 11:09:34,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {5928#true} assume true; {5928#true} is VALID [2022-04-27 11:09:34,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5928#true} {5928#true} #61#return; {5928#true} is VALID [2022-04-27 11:09:34,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {5928#true} call ULTIMATE.init(); {5946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:34,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {5946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5928#true} is VALID [2022-04-27 11:09:34,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {5928#true} assume true; {5928#true} is VALID [2022-04-27 11:09:34,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5928#true} {5928#true} #61#return; {5928#true} is VALID [2022-04-27 11:09:34,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {5928#true} call #t~ret11 := main(); {5928#true} is VALID [2022-04-27 11:09:34,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {5928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5933#(= main_~y~0 0)} is VALID [2022-04-27 11:09:34,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {5933#(= 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; {5934#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:34,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {5934#(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; {5935#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:34,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {5935#(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; {5936#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:34,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {5936#(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; {5937#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:34,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {5937#(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; {5938#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:34,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {5938#(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; {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5940#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:09:34,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {5940#(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; {5941#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:34,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {5941#(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; {5942#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:34,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {5942#(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; {5943#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:34,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {5943#(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; {5944#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {5944#(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; {5945#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {5945#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5929#false} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {5929#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5929#false} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {5929#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5929#false} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {5929#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5929#false} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {5929#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5929#false} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {5929#false} assume !(~y~0 % 4294967296 > 0); {5929#false} is VALID [2022-04-27 11:09:34,027 INFO L272 TraceCheckUtils]: 25: Hoare triple {5929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5929#false} is VALID [2022-04-27 11:09:34,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {5929#false} ~cond := #in~cond; {5929#false} is VALID [2022-04-27 11:09:34,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {5929#false} assume 0 == ~cond; {5929#false} is VALID [2022-04-27 11:09:34,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {5929#false} assume !false; {5929#false} is VALID [2022-04-27 11:09:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 11:09:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:34,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412464710] [2022-04-27 11:09:34,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412464710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:34,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614113755] [2022-04-27 11:09:34,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:09:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:34,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:34,029 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:34,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 11:09:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:34,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 11:09:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:34,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:34,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {5928#true} call ULTIMATE.init(); {5928#true} is VALID [2022-04-27 11:09:34,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {5928#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); {5928#true} is VALID [2022-04-27 11:09:34,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {5928#true} assume true; {5928#true} is VALID [2022-04-27 11:09:34,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5928#true} {5928#true} #61#return; {5928#true} is VALID [2022-04-27 11:09:34,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {5928#true} call #t~ret11 := main(); {5928#true} is VALID [2022-04-27 11:09:34,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {5928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5933#(= main_~y~0 0)} is VALID [2022-04-27 11:09:34,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {5933#(= 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; {5934#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:34,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {5934#(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; {5935#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:34,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {5935#(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; {5936#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:34,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {5936#(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; {5937#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:34,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {5937#(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; {5938#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:34,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {5938#(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; {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5989#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {5989#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5993#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:34,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {5993#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5997#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {5997#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6001#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-27 11:09:34,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {6001#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6005#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {6005#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:34,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {5939#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5938#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:34,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {5938#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5937#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:34,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {5937#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5936#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:34,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {5936#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5935#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:34,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {5935#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~y~0 % 4294967296 > 0); {5929#false} is VALID [2022-04-27 11:09:34,409 INFO L272 TraceCheckUtils]: 25: Hoare triple {5929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5929#false} is VALID [2022-04-27 11:09:34,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {5929#false} ~cond := #in~cond; {5929#false} is VALID [2022-04-27 11:09:34,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {5929#false} assume 0 == ~cond; {5929#false} is VALID [2022-04-27 11:09:34,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {5929#false} assume !false; {5929#false} is VALID [2022-04-27 11:09:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:09:34,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:34,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {5929#false} assume !false; {5929#false} is VALID [2022-04-27 11:09:34,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {5929#false} assume 0 == ~cond; {5929#false} is VALID [2022-04-27 11:09:34,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {5929#false} ~cond := #in~cond; {5929#false} is VALID [2022-04-27 11:09:34,671 INFO L272 TraceCheckUtils]: 25: Hoare triple {5929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5929#false} is VALID [2022-04-27 11:09:34,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {6051#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5929#false} is VALID [2022-04-27 11:09:34,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {6055#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6051#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:34,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {6059#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6055#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:34,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {6063#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6059#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:09:34,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {6067#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6063#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:34,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {6067#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6067#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:34,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {6074#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6067#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:34,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6074#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:34,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {6082#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6078#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:34,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {6086#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6082#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:34,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {6090#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6086#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:34,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {5928#true} ~z~0 := ~y~0; {6090#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:34,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {5928#true} assume !(~x~0 % 4294967296 > 0); {5928#true} is VALID [2022-04-27 11:09:34,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {5928#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5928#true} is VALID [2022-04-27 11:09:34,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {5928#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {5928#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {5928#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {5928#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {5928#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {5928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {5928#true} call #t~ret11 := main(); {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5928#true} {5928#true} #61#return; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {5928#true} assume true; {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {5928#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); {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {5928#true} call ULTIMATE.init(); {5928#true} is VALID [2022-04-27 11:09:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:09:34,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614113755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:34,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:34,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 31 [2022-04-27 11:09:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970013094] [2022-04-27 11:09:34,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:34,680 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 30 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 29 [2022-04-27 11:09:34,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:34,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 30 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-27 11:09:34,718 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-27 11:09:34,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:09:34,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:34,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:09:34,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:09:34,719 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 30 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-27 11:09:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:37,155 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2022-04-27 11:09:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 11:09:37,156 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 30 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 29 [2022-04-27 11:09:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 30 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-27 11:09:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 114 transitions. [2022-04-27 11:09:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 30 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-27 11:09:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 114 transitions. [2022-04-27 11:09:37,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 114 transitions. [2022-04-27 11:09:37,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:37,292 INFO L225 Difference]: With dead ends: 163 [2022-04-27 11:09:37,292 INFO L226 Difference]: Without dead ends: 136 [2022-04-27 11:09:37,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1501 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1121, Invalid=4281, Unknown=0, NotChecked=0, Total=5402 [2022-04-27 11:09:37,294 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 233 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:37,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 77 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:09:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-27 11:09:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 61. [2022-04-27 11:09:37,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:37,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:37,471 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:37,471 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:37,473 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-27 11:09:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-27 11:09:37,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:37,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:37,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 136 states. [2022-04-27 11:09:37,473 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 136 states. [2022-04-27 11:09:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:37,475 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-27 11:09:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-27 11:09:37,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:37,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:37,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:37,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-27 11:09:37,476 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 29 [2022-04-27 11:09:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:37,476 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-27 11:09:37,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 30 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-27 11:09:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-27 11:09:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:09:37,476 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:37,476 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:37,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:37,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:09:37,692 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 14 times [2022-04-27 11:09:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:37,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913987968] [2022-04-27 11:09:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:37,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {6871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6857#true} is VALID [2022-04-27 11:09:37,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {6857#true} assume true; {6857#true} is VALID [2022-04-27 11:09:37,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6857#true} {6857#true} #61#return; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {6857#true} call ULTIMATE.init(); {6871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {6871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {6857#true} assume true; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6857#true} {6857#true} #61#return; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {6857#true} call #t~ret11 := main(); {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {6857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:37,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:37,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {6857#true} assume !(~x~0 % 4294967296 > 0); {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:37,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:37,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:37,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:37,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:37,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:37,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:37,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:37,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:37,852 INFO L272 TraceCheckUtils]: 28: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:37,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {6869#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6870#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:37,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {6870#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6858#false} is VALID [2022-04-27 11:09:37,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {6858#false} assume !false; {6858#false} is VALID [2022-04-27 11:09:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:09:37,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:37,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913987968] [2022-04-27 11:09:37,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913987968] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:37,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849037989] [2022-04-27 11:09:37,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:09:37,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:37,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:37,854 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:37,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 11:09:37,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:09:37,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:37,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 11:09:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:37,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:38,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {6857#true} call ULTIMATE.init(); {6857#true} is VALID [2022-04-27 11:09:38,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {6857#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); {6857#true} is VALID [2022-04-27 11:09:38,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {6857#true} assume true; {6857#true} is VALID [2022-04-27 11:09:38,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6857#true} {6857#true} #61#return; {6857#true} is VALID [2022-04-27 11:09:38,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {6857#true} call #t~ret11 := main(); {6857#true} is VALID [2022-04-27 11:09:38,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {6857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6857#true} is VALID [2022-04-27 11:09:38,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {6857#true} assume !(~x~0 % 4294967296 > 0); {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:38,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:38,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:38,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:38,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,146 INFO L272 TraceCheckUtils]: 28: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:38,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {6959#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6963#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:38,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {6963#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6858#false} is VALID [2022-04-27 11:09:38,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {6858#false} assume !false; {6858#false} is VALID [2022-04-27 11:09:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:09:38,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:38,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {6858#false} assume !false; {6858#false} is VALID [2022-04-27 11:09:38,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {6963#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6858#false} is VALID [2022-04-27 11:09:38,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {6959#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6963#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:38,372 INFO L272 TraceCheckUtils]: 28: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6959#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:38,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:38,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:38,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {6868#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6867#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:38,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6866#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6865#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6864#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:38,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6863#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {6857#true} assume !(~x~0 % 4294967296 > 0); {6862#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {6857#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {6857#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {6857#true} call #t~ret11 := main(); {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6857#true} {6857#true} #61#return; {6857#true} is VALID [2022-04-27 11:09:38,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {6857#true} assume true; {6857#true} is VALID [2022-04-27 11:09:38,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {6857#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); {6857#true} is VALID [2022-04-27 11:09:38,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {6857#true} call ULTIMATE.init(); {6857#true} is VALID [2022-04-27 11:09:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:09:38,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849037989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:38,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:38,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2022-04-27 11:09:38,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346225532] [2022-04-27 11:09:38,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:38,382 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:09:38,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:38,383 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:38,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:38,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:09:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:09:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:09:38,406 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:39,197 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-04-27 11:09:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:09:39,197 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:09:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:39,197 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-27 11:09:39,198 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-27 11:09:39,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2022-04-27 11:09:39,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:39,244 INFO L225 Difference]: With dead ends: 88 [2022-04-27 11:09:39,244 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 11:09:39,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-04-27 11:09:39,245 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:39,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:09:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 11:09:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-04-27 11:09:39,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:39,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 69 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,496 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 69 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,496 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 69 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:39,497 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-27 11:09:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-04-27 11:09:39,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:39,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:39,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-27 11:09:39,498 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-27 11:09:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:39,499 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-27 11:09:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-04-27 11:09:39,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:39,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:39,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:39,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2022-04-27 11:09:39,500 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 32 [2022-04-27 11:09:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:39,500 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2022-04-27 11:09:39,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-04-27 11:09:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:09:39,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:39,500 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:39,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 11:09:39,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:39,716 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1713776814, now seen corresponding path program 15 times [2022-04-27 11:09:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:39,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257438549] [2022-04-27 11:09:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:39,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:39,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:39,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {7496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7477#true} is VALID [2022-04-27 11:09:39,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-27 11:09:39,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7477#true} {7477#true} #61#return; {7477#true} is VALID [2022-04-27 11:09:39,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {7477#true} call ULTIMATE.init(); {7496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:39,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7477#true} is VALID [2022-04-27 11:09:39,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-27 11:09:39,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #61#return; {7477#true} is VALID [2022-04-27 11:09:39,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {7477#true} call #t~ret11 := main(); {7477#true} is VALID [2022-04-27 11:09:39,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {7477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7482#(= main_~y~0 0)} is VALID [2022-04-27 11:09:39,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {7482#(= 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; {7483#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:39,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {7483#(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; {7484#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:39,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {7484#(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; {7485#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:39,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {7485#(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; {7486#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:39,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {7486#(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; {7487#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:39,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {7487#(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; {7488#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:39,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {7488#(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; {7489#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:39,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {7489#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7489#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:39,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {7489#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7490#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:09:39,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {7490#(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; {7491#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:09:39,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {7491#(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; {7492#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:39,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {7492#(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; {7493#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:39,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {7493#(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; {7494#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:39,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {7494#(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; {7495#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {7495#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {7478#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {7478#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {7478#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {7478#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {7478#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {7478#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {7478#false} assume !(~y~0 % 4294967296 > 0); {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L272 TraceCheckUtils]: 28: Hoare triple {7478#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {7478#false} ~cond := #in~cond; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {7478#false} assume 0 == ~cond; {7478#false} is VALID [2022-04-27 11:09:39,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {7478#false} assume !false; {7478#false} is VALID [2022-04-27 11:09:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:09:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:39,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257438549] [2022-04-27 11:09:39,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257438549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:39,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481426778] [2022-04-27 11:09:39,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:09:39,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:39,942 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:39,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 11:09:40,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 11:09:40,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:40,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 11:09:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:40,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:40,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {7477#true} call ULTIMATE.init(); {7477#true} is VALID [2022-04-27 11:09:40,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#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); {7477#true} is VALID [2022-04-27 11:09:40,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-27 11:09:40,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #61#return; {7477#true} is VALID [2022-04-27 11:09:40,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {7477#true} call #t~ret11 := main(); {7477#true} is VALID [2022-04-27 11:09:40,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {7477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7477#true} is VALID [2022-04-27 11:09:40,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#true} assume !(~x~0 % 4294967296 > 0); {7477#true} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {7477#true} ~z~0 := ~y~0; {7542#(= main_~z~0 main_~y~0)} is VALID [2022-04-27 11:09:40,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {7542#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7546#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-27 11:09:40,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {7546#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7550#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-27 11:09:40,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {7550#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7554#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-27 11:09:40,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {7554#(= main_~y~0 (+ main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7558#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-27 11:09:40,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {7558#(= (+ main_~y~0 (- 3)) (+ 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; {7562#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-27 11:09:40,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {7562#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {7566#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:40,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {7566#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7570#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:40,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {7570#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7574#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:40,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {7574#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:40,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7582#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:40,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {7582#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7586#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:40,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {7586#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:40,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {7478#false} assume !(~y~0 % 4294967296 > 0); {7478#false} is VALID [2022-04-27 11:09:40,296 INFO L272 TraceCheckUtils]: 28: Hoare triple {7478#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7478#false} is VALID [2022-04-27 11:09:40,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {7478#false} ~cond := #in~cond; {7478#false} is VALID [2022-04-27 11:09:40,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {7478#false} assume 0 == ~cond; {7478#false} is VALID [2022-04-27 11:09:40,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {7478#false} assume !false; {7478#false} is VALID [2022-04-27 11:09:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:09:40,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:40,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {7478#false} assume !false; {7478#false} is VALID [2022-04-27 11:09:40,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {7478#false} assume 0 == ~cond; {7478#false} is VALID [2022-04-27 11:09:40,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {7478#false} ~cond := #in~cond; {7478#false} is VALID [2022-04-27 11:09:40,578 INFO L272 TraceCheckUtils]: 28: Hoare triple {7478#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7478#false} is VALID [2022-04-27 11:09:40,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {7478#false} assume !(~y~0 % 4294967296 > 0); {7478#false} is VALID [2022-04-27 11:09:40,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {7586#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7478#false} is VALID [2022-04-27 11:09:40,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {7582#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7586#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:40,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {7578#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7582#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:40,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {7574#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7578#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:40,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {7570#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7574#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:40,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {7566#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7570#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:40,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {7638#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7566#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:40,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {7642#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7638#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:09:40,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {7646#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7642#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:40,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {7650#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7646#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:40,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7650#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {7658#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7654#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {7477#true} ~z~0 := ~y~0; {7658#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {7477#true} assume !(~x~0 % 4294967296 > 0); {7477#true} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {7477#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {7477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {7477#true} call #t~ret11 := main(); {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7477#true} {7477#true} #61#return; {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {7477#true} assume true; {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {7477#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); {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {7477#true} call ULTIMATE.init(); {7477#true} is VALID [2022-04-27 11:09:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:09:40,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481426778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:40,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:40,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 35 [2022-04-27 11:09:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720662120] [2022-04-27 11:09:40,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:40,588 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 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 32 [2022-04-27 11:09:40,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:40,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:40,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:40,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 11:09:40,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:40,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 11:09:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 11:09:40,623 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:45,857 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2022-04-27 11:09:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-27 11:09:45,857 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 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 32 [2022-04-27 11:09:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 111 transitions. [2022-04-27 11:09:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 111 transitions. [2022-04-27 11:09:45,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 111 transitions. [2022-04-27 11:09:45,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:45,986 INFO L225 Difference]: With dead ends: 128 [2022-04-27 11:09:45,987 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 11:09:45,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=733, Invalid=6923, Unknown=0, NotChecked=0, Total=7656 [2022-04-27 11:09:45,989 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:45,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 118 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-27 11:09:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 11:09:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2022-04-27 11:09:46,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:46,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 77 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 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-27 11:09:46,206 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 77 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 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-27 11:09:46,206 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 77 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 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-27 11:09:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:46,207 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-04-27 11:09:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-04-27 11:09:46,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:46,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:46,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 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 85 states. [2022-04-27 11:09:46,208 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 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 85 states. [2022-04-27 11:09:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:46,211 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-04-27 11:09:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-04-27 11:09:46,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:46,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:46,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:46,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 72 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-27 11:09:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-04-27 11:09:46,214 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 32 [2022-04-27 11:09:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:46,214 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-04-27 11:09:46,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-04-27 11:09:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 11:09:46,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:46,214 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:46,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:46,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:46,427 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1838716096, now seen corresponding path program 16 times [2022-04-27 11:09:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:46,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464261910] [2022-04-27 11:09:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:46,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {8328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8307#true} is VALID [2022-04-27 11:09:46,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {8307#true} assume true; {8307#true} is VALID [2022-04-27 11:09:46,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8307#true} {8307#true} #61#return; {8307#true} is VALID [2022-04-27 11:09:46,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {8307#true} call ULTIMATE.init(); {8328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:46,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {8328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8307#true} is VALID [2022-04-27 11:09:46,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {8307#true} assume true; {8307#true} is VALID [2022-04-27 11:09:46,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8307#true} {8307#true} #61#return; {8307#true} is VALID [2022-04-27 11:09:46,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {8307#true} call #t~ret11 := main(); {8307#true} is VALID [2022-04-27 11:09:46,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {8307#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8312#(= main_~y~0 0)} is VALID [2022-04-27 11:09:46,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {8312#(= 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; {8313#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:46,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {8313#(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; {8314#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:46,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {8314#(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; {8315#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:46,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {8315#(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; {8316#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:46,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {8316#(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; {8317#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:46,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {8317#(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; {8318#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:46,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {8318#(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; {8319#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:46,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {8319#(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; {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:46,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:46,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {8321#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:09:46,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {8321#(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; {8322#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:09:46,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {8322#(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; {8323#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:09:46,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {8323#(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; {8324#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:46,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {8324#(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; {8325#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:46,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {8325#(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; {8326#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:09:46,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {8326#(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; {8327#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {8327#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {8308#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {8308#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {8308#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {8308#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {8308#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {8308#false} assume !(~y~0 % 4294967296 > 0); {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L272 TraceCheckUtils]: 29: Hoare triple {8308#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {8308#false} ~cond := #in~cond; {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {8308#false} assume 0 == ~cond; {8308#false} is VALID [2022-04-27 11:09:46,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {8308#false} assume !false; {8308#false} is VALID [2022-04-27 11:09:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:09:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464261910] [2022-04-27 11:09:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464261910] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940086467] [2022-04-27 11:09:46,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:09:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:46,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:46,679 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:46,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 11:09:46,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:09:46,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:46,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 11:09:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:46,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:47,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {8307#true} call ULTIMATE.init(); {8307#true} is VALID [2022-04-27 11:09:47,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {8307#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); {8307#true} is VALID [2022-04-27 11:09:47,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {8307#true} assume true; {8307#true} is VALID [2022-04-27 11:09:47,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8307#true} {8307#true} #61#return; {8307#true} is VALID [2022-04-27 11:09:47,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {8307#true} call #t~ret11 := main(); {8307#true} is VALID [2022-04-27 11:09:47,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {8307#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8312#(= main_~y~0 0)} is VALID [2022-04-27 11:09:47,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {8312#(= 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; {8313#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:47,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {8313#(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; {8314#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:47,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {8314#(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; {8315#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:47,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {8315#(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; {8316#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:47,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {8316#(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; {8317#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:47,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {8317#(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; {8318#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:47,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {8318#(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; {8319#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:47,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {8319#(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; {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {8377#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {8377#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8381#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:47,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {8381#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8385#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {8385#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8389#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {8389#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8393#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {8393#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8397#(and (<= main_~y~0 8) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {8397#(and (<= main_~y~0 8) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:47,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {8320#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8319#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:47,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {8319#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8318#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:47,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {8318#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8317#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:47,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {8317#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8316#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:47,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {8316#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8315#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:47,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {8315#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~y~0 % 4294967296 > 0); {8308#false} is VALID [2022-04-27 11:09:47,125 INFO L272 TraceCheckUtils]: 29: Hoare triple {8308#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8308#false} is VALID [2022-04-27 11:09:47,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {8308#false} ~cond := #in~cond; {8308#false} is VALID [2022-04-27 11:09:47,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {8308#false} assume 0 == ~cond; {8308#false} is VALID [2022-04-27 11:09:47,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {8308#false} assume !false; {8308#false} is VALID [2022-04-27 11:09:47,125 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-27 11:09:47,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:47,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {8308#false} assume !false; {8308#false} is VALID [2022-04-27 11:09:47,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {8308#false} assume 0 == ~cond; {8308#false} is VALID [2022-04-27 11:09:47,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {8308#false} ~cond := #in~cond; {8308#false} is VALID [2022-04-27 11:09:47,489 INFO L272 TraceCheckUtils]: 29: Hoare triple {8308#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8308#false} is VALID [2022-04-27 11:09:47,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {8446#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8308#false} is VALID [2022-04-27 11:09:47,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {8450#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8446#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:09:47,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {8454#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8450#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:09:47,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {8458#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8454#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:09:47,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {8462#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8458#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:09:47,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {8466#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8462#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:47,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {8466#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {8466#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:47,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {8473#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8466#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:09:47,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {8477#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8473#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:09:47,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {8481#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8477#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:47,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {8485#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8481#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:09:47,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {8489#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (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; {8485#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:47,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {8493#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8489#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:09:47,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {8307#true} ~z~0 := ~y~0; {8493#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:09:47,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {8307#true} assume !(~x~0 % 4294967296 > 0); {8307#true} is VALID [2022-04-27 11:09:47,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {8307#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {8307#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {8307#true} call #t~ret11 := main(); {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8307#true} {8307#true} #61#return; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {8307#true} assume true; {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {8307#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); {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {8307#true} call ULTIMATE.init(); {8307#true} is VALID [2022-04-27 11:09:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:09:47,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940086467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:47,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:47,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 14] total 37 [2022-04-27 11:09:47,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950886575] [2022-04-27 11:09:47,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:47,500 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:09:47,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:47,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:47,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:47,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-27 11:09:47,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:47,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-27 11:09:47,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2022-04-27 11:09:47,542 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:51,115 INFO L93 Difference]: Finished difference Result 200 states and 234 transitions. [2022-04-27 11:09:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-27 11:09:51,115 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 11:09:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 133 transitions. [2022-04-27 11:09:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 133 transitions. [2022-04-27 11:09:51,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 133 transitions. [2022-04-27 11:09:51,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:51,310 INFO L225 Difference]: With dead ends: 200 [2022-04-27 11:09:51,310 INFO L226 Difference]: Without dead ends: 187 [2022-04-27 11:09:51,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1751, Invalid=6439, Unknown=0, NotChecked=0, Total=8190 [2022-04-27 11:09:51,312 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 219 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:51,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 98 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:09:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-27 11:09:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 84. [2022-04-27 11:09:51,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:51,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 84 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,598 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 84 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,598 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 84 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:51,600 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2022-04-27 11:09:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2022-04-27 11:09:51,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:51,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:51,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-27 11:09:51,601 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 187 states. [2022-04-27 11:09:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:51,603 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2022-04-27 11:09:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 213 transitions. [2022-04-27 11:09:51,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:51,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:51,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:51,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-04-27 11:09:51,605 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 33 [2022-04-27 11:09:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:51,605 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-04-27 11:09:51,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 36 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-04-27 11:09:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:09:51,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:51,606 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:51,623 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-27 11:09:51,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:51,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 17 times [2022-04-27 11:09:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:51,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021103951] [2022-04-27 11:09:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:52,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {9511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9496#true} is VALID [2022-04-27 11:09:52,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {9496#true} assume true; {9496#true} is VALID [2022-04-27 11:09:52,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9496#true} {9496#true} #61#return; {9496#true} is VALID [2022-04-27 11:09:52,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {9496#true} call ULTIMATE.init(); {9511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:52,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {9511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9496#true} is VALID [2022-04-27 11:09:52,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {9496#true} assume true; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9496#true} {9496#true} #61#return; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {9496#true} call #t~ret11 := main(); {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {9496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {9496#true} assume !(~x~0 % 4294967296 > 0); {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:52,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:52,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:52,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:52,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,015 INFO L272 TraceCheckUtils]: 31: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9509#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:09:52,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {9509#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9510#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:09:52,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {9510#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9497#false} is VALID [2022-04-27 11:09:52,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {9497#false} assume !false; {9497#false} is VALID [2022-04-27 11:09:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:09:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:52,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021103951] [2022-04-27 11:09:52,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021103951] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:52,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020266424] [2022-04-27 11:09:52,016 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:09:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:52,017 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:52,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 11:09:52,531 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-04-27 11:09:52,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:52,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 11:09:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:52,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:52,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {9496#true} call ULTIMATE.init(); {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {9496#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); {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {9496#true} assume true; {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9496#true} {9496#true} #61#return; {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {9496#true} call #t~ret11 := main(); {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {9496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:52,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {9496#true} assume !(~x~0 % 4294967296 > 0); {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:52,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:52,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,783 INFO L290 TraceCheckUtils]: 22: Hoare triple {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:52,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:52,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:52,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:52,789 INFO L272 TraceCheckUtils]: 31: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9608#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:52,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {9608#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9612#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:52,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {9612#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9497#false} is VALID [2022-04-27 11:09:52,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {9497#false} assume !false; {9497#false} is VALID [2022-04-27 11:09:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:09:52,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:53,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {9497#false} assume !false; {9497#false} is VALID [2022-04-27 11:09:53,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {9612#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9497#false} is VALID [2022-04-27 11:09:53,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {9608#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9612#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:09:53,036 INFO L272 TraceCheckUtils]: 31: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9608#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:09:53,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:53,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:53,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:53,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:53,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {9508#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {9507#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9506#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:09:53,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9505#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9504#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9503#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:09:53,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9502#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {9496#true} assume !(~x~0 % 4294967296 > 0); {9501#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:53,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {9496#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {9496#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {9496#true} call #t~ret11 := main(); {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9496#true} {9496#true} #61#return; {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {9496#true} assume true; {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {9496#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); {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {9496#true} call ULTIMATE.init(); {9496#true} is VALID [2022-04-27 11:09:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:09:53,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020266424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:53,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:53,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2022-04-27 11:09:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218760120] [2022-04-27 11:09:53,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:53,048 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:09:53,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:53,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:53,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:53,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:09:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:53,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:09:53,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:09:53,080 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:54,038 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2022-04-27 11:09:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:09:54,039 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 11:09:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:09:54,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-27 11:09:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-27 11:09:54,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2022-04-27 11:09:54,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:54,089 INFO L225 Difference]: With dead ends: 122 [2022-04-27 11:09:54,089 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 11:09:54,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:09:54,090 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:09:54,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:09:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 11:09:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2022-04-27 11:09:54,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:09:54,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,388 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,388 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:54,390 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-04-27 11:09:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-04-27 11:09:54,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:54,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:54,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 11:09:54,390 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 11:09:54,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:09:54,391 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-04-27 11:09:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-04-27 11:09:54,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:09:54,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:09:54,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:09:54,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:09:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-04-27 11:09:54,393 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 35 [2022-04-27 11:09:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:09:54,393 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-04-27 11:09:54,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-04-27 11:09:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:09:54,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:09:54,393 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:09:54,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-27 11:09:54,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:54,610 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:09:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:09:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 210525599, now seen corresponding path program 18 times [2022-04-27 11:09:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:09:54,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739532637] [2022-04-27 11:09:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:09:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:09:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:09:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:54,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {10319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10297#true} is VALID [2022-04-27 11:09:54,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {10297#true} assume true; {10297#true} is VALID [2022-04-27 11:09:54,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10297#true} {10297#true} #61#return; {10297#true} is VALID [2022-04-27 11:09:54,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {10297#true} call ULTIMATE.init(); {10319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:09:54,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {10319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10297#true} is VALID [2022-04-27 11:09:54,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {10297#true} assume true; {10297#true} is VALID [2022-04-27 11:09:54,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10297#true} {10297#true} #61#return; {10297#true} is VALID [2022-04-27 11:09:54,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {10297#true} call #t~ret11 := main(); {10297#true} is VALID [2022-04-27 11:09:54,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {10297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10302#(= main_~y~0 0)} is VALID [2022-04-27 11:09:54,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {10302#(= 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; {10303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:54,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {10303#(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; {10304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:54,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {10304#(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; {10305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:54,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {10305#(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; {10306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:54,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {10306#(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; {10307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:54,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {10307#(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; {10308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:54,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {10308#(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; {10309#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:54,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {10309#(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; {10310#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:54,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {10310#(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; {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:54,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:54,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10312#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:09:54,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {10312#(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; {10313#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:09:54,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {10313#(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; {10314#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:09:54,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {10314#(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; {10315#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:09:54,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {10315#(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; {10316#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:09:54,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {10316#(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; {10317#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:09:54,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {10317#(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; {10318#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:09:54,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {10318#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10298#false} is VALID [2022-04-27 11:09:54,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:54,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:54,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:54,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {10298#false} assume !(~y~0 % 4294967296 > 0); {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L272 TraceCheckUtils]: 32: Hoare triple {10298#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {10298#false} ~cond := #in~cond; {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {10298#false} assume 0 == ~cond; {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {10298#false} assume !false; {10298#false} is VALID [2022-04-27 11:09:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:09:54,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:09:54,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739532637] [2022-04-27 11:09:54,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739532637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:09:54,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765219462] [2022-04-27 11:09:54,893 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:09:54,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:09:54,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:09:54,900 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:09:54,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-27 11:09:54,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-27 11:09:54,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:09:54,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 11:09:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:09:55,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:09:55,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {10297#true} call ULTIMATE.init(); {10297#true} is VALID [2022-04-27 11:09:55,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {10297#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); {10297#true} is VALID [2022-04-27 11:09:55,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {10297#true} assume true; {10297#true} is VALID [2022-04-27 11:09:55,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10297#true} {10297#true} #61#return; {10297#true} is VALID [2022-04-27 11:09:55,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {10297#true} call #t~ret11 := main(); {10297#true} is VALID [2022-04-27 11:09:55,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {10297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10302#(= main_~y~0 0)} is VALID [2022-04-27 11:09:55,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {10302#(= 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; {10303#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:09:55,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {10303#(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; {10304#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:09:55,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {10304#(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; {10305#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:09:55,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {10305#(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; {10306#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:09:55,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {10306#(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; {10307#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:09:55,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {10307#(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; {10308#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:09:55,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {10308#(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; {10309#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:09:55,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {10309#(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; {10310#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:09:55,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {10310#(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; {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:55,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:55,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {10311#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {10371#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:55,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {10371#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~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; {10375#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:09:55,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {10375#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10379#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:55,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {10379#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~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; {10383#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:55,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {10383#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~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; {10387#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-27 11:09:55,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {10387#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10391#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:55,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {10391#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~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; {10395#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {10395#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {10298#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {10298#false} assume !(~y~0 % 4294967296 > 0); {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L272 TraceCheckUtils]: 32: Hoare triple {10298#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {10298#false} ~cond := #in~cond; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {10298#false} assume 0 == ~cond; {10298#false} is VALID [2022-04-27 11:09:55,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {10298#false} assume !false; {10298#false} is VALID [2022-04-27 11:09:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:09:55,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:09:55,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {10298#false} assume !false; {10298#false} is VALID [2022-04-27 11:09:55,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {10298#false} assume 0 == ~cond; {10298#false} is VALID [2022-04-27 11:09:55,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {10298#false} ~cond := #in~cond; {10298#false} is VALID [2022-04-27 11:09:55,762 INFO L272 TraceCheckUtils]: 32: Hoare triple {10298#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10298#false} is VALID [2022-04-27 11:09:55,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {10298#false} assume !(~y~0 % 4294967296 > 0); {10298#false} is VALID [2022-04-27 11:09:55,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {10450#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10298#false} is VALID [2022-04-27 11:09:55,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {10454#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10450#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:09:55,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {10458#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10454#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:09:55,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {10462#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10458#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:09:55,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {10466#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10462#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:09:55,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {10470#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10466#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:55,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {10474#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10470#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:55,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {10478#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {10474#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:09:55,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {10482#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10478#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:55,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {10486#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10482#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:55,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {10490#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10486#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:55,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {10494#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10490#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:55,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {10498#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10494#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:55,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {10502#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10498#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {10297#true} ~z~0 := ~y~0; {10502#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {10297#true} assume !(~x~0 % 4294967296 > 0); {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {10297#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {10297#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {10297#true} call #t~ret11 := main(); {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10297#true} {10297#true} #61#return; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {10297#true} assume true; {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {10297#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); {10297#true} is VALID [2022-04-27 11:09:55,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {10297#true} call ULTIMATE.init(); {10297#true} is VALID [2022-04-27 11:09:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:09:55,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765219462] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:09:55,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:09:55,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 41 [2022-04-27 11:09:55,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664813631] [2022-04-27 11:09:55,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:09:55,773 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:09:55,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:09:55,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:09:55,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:09:55,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-27 11:09:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:09:55,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-27 11:09:55,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2022-04-27 11:09:55,833 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:03,244 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2022-04-27 11:10:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-27 11:10:03,244 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-27 11:10:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:10:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 134 transitions. [2022-04-27 11:10:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 134 transitions. [2022-04-27 11:10:03,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 134 transitions. [2022-04-27 11:10:03,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:03,466 INFO L225 Difference]: With dead ends: 160 [2022-04-27 11:10:03,466 INFO L226 Difference]: Without dead ends: 124 [2022-04-27 11:10:03,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2978 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1227, Invalid=10763, Unknown=0, NotChecked=0, Total=11990 [2022-04-27 11:10:03,469 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:10:03,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 125 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 11:10:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-27 11:10:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2022-04-27 11:10:03,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:10:03,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 114 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,887 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 114 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,887 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 114 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:03,888 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-04-27 11:10:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2022-04-27 11:10:03,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:03,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:03,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-27 11:10:03,889 INFO L87 Difference]: Start difference. First operand has 114 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-27 11:10:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:03,890 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-04-27 11:10:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2022-04-27 11:10:03,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:03,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:03,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:10:03,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:10:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.1376146788990826) internal successors, (124), 109 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2022-04-27 11:10:03,892 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 36 [2022-04-27 11:10:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:10:03,892 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2022-04-27 11:10:03,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2022-04-27 11:10:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 11:10:03,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:10:03,893 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:10:03,912 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-27 11:10:04,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-27 11:10:04,103 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:10:04,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:10:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1139261807, now seen corresponding path program 19 times [2022-04-27 11:10:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:10:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227859351] [2022-04-27 11:10:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:10:04,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:10:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:10:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:04,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {11413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-27 11:10:04,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-27 11:10:04,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11389#true} {11389#true} #61#return; {11389#true} is VALID [2022-04-27 11:10:04,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:10:04,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {11413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11389#true} is VALID [2022-04-27 11:10:04,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-27 11:10:04,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #61#return; {11389#true} is VALID [2022-04-27 11:10:04,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret11 := main(); {11389#true} is VALID [2022-04-27 11:10:04,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11394#(= main_~y~0 0)} is VALID [2022-04-27 11:10:04,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {11394#(= 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; {11395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:04,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {11395#(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; {11396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:10:04,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {11396#(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; {11397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:10:04,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {11397#(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; {11398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:10:04,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {11398#(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; {11399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:10:04,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {11399#(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; {11400#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:10:04,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {11400#(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; {11401#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:04,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {11401#(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; {11402#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:10:04,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {11402#(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; {11403#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:04,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {11403#(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; {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:10:04,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:10:04,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {11405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:10:04,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {11405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:10:04,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {11406#(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; {11407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:10:04,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {11407#(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; {11408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:10:04,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {11408#(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; {11409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:10:04,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {11409#(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; {11410#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:10:04,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {11410#(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; {11411#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {11411#(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; {11412#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {11412#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {11390#false} assume !(~y~0 % 4294967296 > 0); {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L272 TraceCheckUtils]: 33: Hoare triple {11390#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-27 11:10:04,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-27 11:10:04,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-27 11:10:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:10:04,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:10:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227859351] [2022-04-27 11:10:04,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227859351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:10:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832352767] [2022-04-27 11:10:04,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:10:04,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:10:04,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:10:04,409 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:10:04,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-27 11:10:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:04,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-27 11:10:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:04,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:10:04,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11389#true} is VALID [2022-04-27 11:10:04,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#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); {11389#true} is VALID [2022-04-27 11:10:04,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-27 11:10:04,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #61#return; {11389#true} is VALID [2022-04-27 11:10:04,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret11 := main(); {11389#true} is VALID [2022-04-27 11:10:04,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11394#(= main_~y~0 0)} is VALID [2022-04-27 11:10:04,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {11394#(= 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; {11395#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:10:04,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {11395#(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; {11396#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:10:04,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {11396#(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; {11397#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:10:04,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {11397#(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; {11398#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:10:04,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {11398#(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; {11399#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:10:04,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {11399#(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; {11400#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:10:04,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {11400#(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; {11401#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:10:04,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {11401#(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; {11402#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:10:04,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {11402#(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; {11403#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:10:04,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {11403#(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; {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:10:04,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:10:04,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {11404#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {11405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:10:04,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {11405#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11406#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:10:04,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {11406#(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; {11407#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:10:04,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {11407#(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; {11408#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:10:04,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {11408#(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; {11409#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:10:04,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {11409#(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; {11410#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:10:04,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {11410#(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; {11411#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:10:04,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {11411#(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; {11489#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {11489#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {11390#false} assume !(~y~0 % 4294967296 > 0); {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L272 TraceCheckUtils]: 33: Hoare triple {11390#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-27 11:10:04,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-27 11:10:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:10:04,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:10:05,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {11390#false} assume !false; {11390#false} is VALID [2022-04-27 11:10:05,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {11390#false} assume 0 == ~cond; {11390#false} is VALID [2022-04-27 11:10:05,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {11390#false} ~cond := #in~cond; {11390#false} is VALID [2022-04-27 11:10:05,259 INFO L272 TraceCheckUtils]: 33: Hoare triple {11390#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11390#false} is VALID [2022-04-27 11:10:05,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {11390#false} assume !(~y~0 % 4294967296 > 0); {11390#false} is VALID [2022-04-27 11:10:05,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:05,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:05,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:05,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:05,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:05,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {11390#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11390#false} is VALID [2022-04-27 11:10:05,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {11559#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11390#false} is VALID [2022-04-27 11:10:05,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {11563#(< 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; {11559#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:10:05,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {11567#(< 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; {11563#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:10:05,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {11571#(< 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; {11567#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:05,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {11575#(< 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; {11571#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:10:05,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {11579#(< 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; {11575#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:10:05,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {11583#(< 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; {11579#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-27 11:10:05,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {11587#(< 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; {11583#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-27 11:10:05,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {11591#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {11587#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-27 11:10:05,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {11591#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11591#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:10:05,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {11598#(< 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; {11591#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:10:05,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {11602#(< 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; {11598#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:05,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {11606#(< 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; {11602#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:05,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {11610#(< 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; {11606#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:10:05,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {11614#(< 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; {11610#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:10:05,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {11618#(< 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; {11614#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:10:05,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {11622#(< 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; {11618#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:10:05,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {11626#(< 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; {11622#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:10:05,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {11630#(< 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; {11626#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:10:05,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {11634#(< 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; {11630#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:10:05,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {11389#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11634#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:10:05,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {11389#true} call #t~ret11 := main(); {11389#true} is VALID [2022-04-27 11:10:05,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11389#true} {11389#true} #61#return; {11389#true} is VALID [2022-04-27 11:10:05,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#true} assume true; {11389#true} is VALID [2022-04-27 11:10:05,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {11389#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); {11389#true} is VALID [2022-04-27 11:10:05,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {11389#true} call ULTIMATE.init(); {11389#true} is VALID [2022-04-27 11:10:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 11:10:05,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832352767] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:10:05,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:10:05,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-27 11:10:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104378621] [2022-04-27 11:10:05,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:10:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:10:05,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:10:05,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:05,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-27 11:10:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:10:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-27 11:10:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2022-04-27 11:10:05,328 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:10:43,897 WARN L232 SmtUtils]: Spent 16.21s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:11:04,615 WARN L232 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:11:24,441 WARN L232 SmtUtils]: Spent 11.10s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:11:42,869 WARN L232 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:11:58,683 WARN L232 SmtUtils]: Spent 10.39s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:12:15,994 WARN L232 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:12:31,370 WARN L232 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:12:43,647 WARN L232 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:12:58,292 WARN L232 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:13:07,902 WARN L232 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:13:17,358 WARN L232 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:15:34,356 WARN L232 SmtUtils]: Spent 13.39s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:15:57,629 WARN L232 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:16:16,493 WARN L232 SmtUtils]: Spent 10.80s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:16:39,974 WARN L232 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:17:00,552 WARN L232 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:18:11,532 WARN L232 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:18:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:42,156 INFO L93 Difference]: Finished difference Result 341 states and 412 transitions. [2022-04-27 11:18:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2022-04-27 11:18:42,156 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-27 11:18:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 358 transitions. [2022-04-27 11:18:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 358 transitions. [2022-04-27 11:18:42,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 358 transitions. [2022-04-27 11:18:48,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:48,230 INFO L225 Difference]: With dead ends: 341 [2022-04-27 11:18:48,231 INFO L226 Difference]: Without dead ends: 312 [2022-04-27 11:18:48,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29539 ImplicationChecksByTransitivity, 500.7s TimeCoverageRelationStatistics Valid=11398, Invalid=66161, Unknown=3, NotChecked=0, Total=77562 [2022-04-27 11:18:48,237 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 434 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1704 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:48,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 139 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1704 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-04-27 11:18:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-27 11:18:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 171. [2022-04-27 11:18:49,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:49,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 171 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 166 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:49,061 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 171 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 166 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:49,062 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 171 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 166 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:49,066 INFO L93 Difference]: Finished difference Result 312 states and 352 transitions. [2022-04-27 11:18:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 352 transitions. [2022-04-27 11:18:49,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:49,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:49,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 166 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 312 states. [2022-04-27 11:18:49,067 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 166 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 312 states. [2022-04-27 11:18:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:49,071 INFO L93 Difference]: Finished difference Result 312 states and 352 transitions. [2022-04-27 11:18:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 352 transitions. [2022-04-27 11:18:49,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:49,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:49,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:49,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.1867469879518073) internal successors, (197), 166 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2022-04-27 11:18:49,074 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 37 [2022-04-27 11:18:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:49,074 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2022-04-27 11:18:49,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 41 states have internal predecessors, (52), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2022-04-27 11:18:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:18:49,074 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:49,075 INFO L195 NwaCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:49,091 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-27 11:18:49,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-27 11:18:49,304 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1526884787, now seen corresponding path program 20 times [2022-04-27 11:18:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284762136] [2022-04-27 11:18:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:49,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {13630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13611#true} is VALID [2022-04-27 11:18:49,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {13611#true} assume true; {13611#true} is VALID [2022-04-27 11:18:49,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13611#true} {13611#true} #61#return; {13611#true} is VALID [2022-04-27 11:18:49,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {13611#true} call ULTIMATE.init(); {13630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:49,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {13630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13611#true} is VALID [2022-04-27 11:18:49,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {13611#true} assume true; {13611#true} is VALID [2022-04-27 11:18:49,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13611#true} {13611#true} #61#return; {13611#true} is VALID [2022-04-27 11:18:49,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {13611#true} call #t~ret11 := main(); {13611#true} is VALID [2022-04-27 11:18:49,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {13611#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13616#(= main_~y~0 0)} is VALID [2022-04-27 11:18:49,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {13616#(= 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; {13617#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:49,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {13617#(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; {13618#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:49,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {13618#(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; {13619#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:49,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {13619#(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; {13620#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:49,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {13620#(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; {13621#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:49,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {13621#(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; {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13623#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:18:49,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {13623#(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; {13624#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:18:49,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {13624#(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; {13625#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:18:49,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {13625#(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; {13626#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:18:49,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {13626#(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; {13627#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:18:49,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {13627#(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; {13628#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:18:49,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {13628#(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; {13629#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:18:49,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {13629#(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; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {13612#false} assume !(~z~0 % 4294967296 > 0); {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {13612#false} assume !(~y~0 % 4294967296 > 0); {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L272 TraceCheckUtils]: 34: Hoare triple {13612#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {13612#false} ~cond := #in~cond; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {13612#false} assume 0 == ~cond; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {13612#false} assume !false; {13612#false} is VALID [2022-04-27 11:18:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:18:49,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284762136] [2022-04-27 11:18:49,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284762136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988060606] [2022-04-27 11:18:49,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:18:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:49,533 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:49,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 11:18:49,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:18:49,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:18:49,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 11:18:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:49,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:49,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {13611#true} call ULTIMATE.init(); {13611#true} is VALID [2022-04-27 11:18:49,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {13611#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); {13611#true} is VALID [2022-04-27 11:18:49,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {13611#true} assume true; {13611#true} is VALID [2022-04-27 11:18:49,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13611#true} {13611#true} #61#return; {13611#true} is VALID [2022-04-27 11:18:49,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {13611#true} call #t~ret11 := main(); {13611#true} is VALID [2022-04-27 11:18:49,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {13611#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13616#(= main_~y~0 0)} is VALID [2022-04-27 11:18:49,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {13616#(= 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; {13617#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:18:49,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {13617#(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; {13618#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:18:49,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {13618#(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; {13619#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:18:49,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {13619#(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; {13620#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:18:49,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {13620#(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; {13621#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:18:49,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {13621#(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; {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {13622#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13673#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {13673#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13677#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:18:49,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {13677#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13681#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {13681#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13685#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {13685#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13689#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {13689#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13693#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {13693#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13697#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-27 11:18:49,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {13697#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13612#false} is VALID [2022-04-27 11:18:49,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {13612#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; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {13612#false} assume !(~z~0 % 4294967296 > 0); {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {13612#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {13612#false} assume !(~y~0 % 4294967296 > 0); {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L272 TraceCheckUtils]: 34: Hoare triple {13612#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {13612#false} ~cond := #in~cond; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {13612#false} assume 0 == ~cond; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {13612#false} assume !false; {13612#false} is VALID [2022-04-27 11:18:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:18:49,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:50,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {13612#false} assume !false; {13612#false} is VALID [2022-04-27 11:18:50,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {13612#false} assume 0 == ~cond; {13612#false} is VALID [2022-04-27 11:18:50,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {13612#false} ~cond := #in~cond; {13612#false} is VALID [2022-04-27 11:18:50,403 INFO L272 TraceCheckUtils]: 34: Hoare triple {13612#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13612#false} is VALID [2022-04-27 11:18:50,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {13764#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {13612#false} is VALID [2022-04-27 11:18:50,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {13768#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13764#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:18:50,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {13772#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13768#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:18:50,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {13776#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13772#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:18:50,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {13780#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13776#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:18:50,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {13784#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13780#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13784#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {13810#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13788#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:18:50,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {13814#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13810#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:18:50,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {13818#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13814#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:18:50,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {13822#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13818#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:18:50,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {13826#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13822#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:18:50,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {13830#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13826#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {13834#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13830#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {13611#true} ~z~0 := ~y~0; {13834#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {13611#true} assume !(~x~0 % 4294967296 > 0); {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {13611#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {13611#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {13611#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {13611#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {13611#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {13611#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {13611#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {13611#true} call #t~ret11 := main(); {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13611#true} {13611#true} #61#return; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {13611#true} assume true; {13611#true} is VALID [2022-04-27 11:18:50,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {13611#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); {13611#true} is VALID [2022-04-27 11:18:50,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {13611#true} call ULTIMATE.init(); {13611#true} is VALID [2022-04-27 11:18:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:18:50,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988060606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:50,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:50,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-27 11:18:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261111590] [2022-04-27 11:18:50,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (4), 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 38 [2022-04-27 11:18:50,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:50,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:50,456 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-27 11:18:50,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 11:18:50,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:50,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 11:18:50,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 11:18:50,456 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:57,101 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2022-04-27 11:18:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-27 11:18:57,101 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (4), 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 38 [2022-04-27 11:18:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:18:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 110 transitions. [2022-04-27 11:18:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 110 transitions. [2022-04-27 11:18:57,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 110 transitions. [2022-04-27 11:18:57,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:57,440 INFO L225 Difference]: With dead ends: 250 [2022-04-27 11:18:57,440 INFO L226 Difference]: Without dead ends: 224 [2022-04-27 11:18:57,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1228, Invalid=6254, Unknown=0, NotChecked=0, Total=7482 [2022-04-27 11:18:57,441 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 260 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:18:57,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 88 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-27 11:18:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-27 11:18:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 140. [2022-04-27 11:18:58,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:18:58,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 140 states, 135 states have (on average 1.2) internal successors, (162), 135 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:58,182 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 140 states, 135 states have (on average 1.2) internal successors, (162), 135 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:58,182 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 140 states, 135 states have (on average 1.2) internal successors, (162), 135 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:58,185 INFO L93 Difference]: Finished difference Result 224 states and 253 transitions. [2022-04-27 11:18:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 253 transitions. [2022-04-27 11:18:58,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:58,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:58,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.2) internal successors, (162), 135 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 224 states. [2022-04-27 11:18:58,185 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.2) internal successors, (162), 135 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 224 states. [2022-04-27 11:18:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:18:58,188 INFO L93 Difference]: Finished difference Result 224 states and 253 transitions. [2022-04-27 11:18:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 253 transitions. [2022-04-27 11:18:58,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:18:58,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:18:58,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:18:58,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:18:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.2) internal successors, (162), 135 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 166 transitions. [2022-04-27 11:18:58,189 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 166 transitions. Word has length 38 [2022-04-27 11:18:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:18:58,190 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 166 transitions. [2022-04-27 11:18:58,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 37 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 166 transitions. [2022-04-27 11:18:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:18:58,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:18:58,190 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:18:58,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 11:18:58,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:58,406 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:18:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:18:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 21 times [2022-04-27 11:18:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:18:58,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977062109] [2022-04-27 11:18:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:18:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:18:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:58,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:18:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:58,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {15105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15089#true} is VALID [2022-04-27 11:18:58,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {15089#true} assume true; {15089#true} is VALID [2022-04-27 11:18:58,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15089#true} {15089#true} #61#return; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {15089#true} call ULTIMATE.init(); {15105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {15105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {15089#true} assume true; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15089#true} {15089#true} #61#return; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {15089#true} call #t~ret11 := main(); {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {15089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:58,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {15089#true} assume !(~x~0 % 4294967296 > 0); {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:58,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:58,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:18:58,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:18:58,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:18:58,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:58,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:18:58,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:58,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:58,640 INFO L272 TraceCheckUtils]: 34: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:18:58,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {15103#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15104#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:18:58,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {15104#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15090#false} is VALID [2022-04-27 11:18:58,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {15090#false} assume !false; {15090#false} is VALID [2022-04-27 11:18:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:18:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:18:58,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977062109] [2022-04-27 11:18:58,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977062109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:18:58,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675105097] [2022-04-27 11:18:58,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:18:58,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:18:58,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:18:58,647 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:18:58,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-27 11:18:58,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-27 11:18:58,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:18:58,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-27 11:18:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:18:58,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:18:59,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {15089#true} call ULTIMATE.init(); {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {15089#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); {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {15089#true} assume true; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15089#true} {15089#true} #61#return; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {15089#true} call #t~ret11 := main(); {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {15089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {15089#true} assume !(~x~0 % 4294967296 > 0); {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:18:59,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:18:59,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:18:59,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:18:59,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,053 INFO L272 TraceCheckUtils]: 34: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15211#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:18:59,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {15211#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15215#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:18:59,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {15215#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15090#false} is VALID [2022-04-27 11:18:59,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {15090#false} assume !false; {15090#false} is VALID [2022-04-27 11:18:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:18:59,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:18:59,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {15090#false} assume !false; {15090#false} is VALID [2022-04-27 11:18:59,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {15215#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15090#false} is VALID [2022-04-27 11:18:59,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {15211#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15215#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:18:59,228 INFO L272 TraceCheckUtils]: 34: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15211#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:18:59,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:18:59,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:18:59,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {15102#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {15101#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {15100#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15099#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:18:59,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15098#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15097#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15096#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:18:59,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15095#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {15089#true} assume !(~x~0 % 4294967296 > 0); {15094#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {15089#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15089#true} is VALID [2022-04-27 11:18:59,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {15089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15089#true} is VALID [2022-04-27 11:18:59,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {15089#true} call #t~ret11 := main(); {15089#true} is VALID [2022-04-27 11:18:59,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15089#true} {15089#true} #61#return; {15089#true} is VALID [2022-04-27 11:18:59,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {15089#true} assume true; {15089#true} is VALID [2022-04-27 11:18:59,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {15089#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); {15089#true} is VALID [2022-04-27 11:18:59,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {15089#true} call ULTIMATE.init(); {15089#true} is VALID [2022-04-27 11:18:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:18:59,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675105097] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:18:59,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:18:59,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2022-04-27 11:18:59,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697888592] [2022-04-27 11:18:59,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:18:59,242 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 11:18:59,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:18:59,242 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:18:59,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:18:59,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:18:59,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:18:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:18:59,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:18:59,277 INFO L87 Difference]: Start difference. First operand 140 states and 166 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:00,672 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2022-04-27 11:19:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:19:00,672 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 11:19:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:00,672 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-27 11:19:00,673 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-27 11:19:00,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2022-04-27 11:19:00,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:00,716 INFO L225 Difference]: With dead ends: 182 [2022-04-27 11:19:00,716 INFO L226 Difference]: Without dead ends: 168 [2022-04-27 11:19:00,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:19:00,717 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:00,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:19:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-27 11:19:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2022-04-27 11:19:01,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:01,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 151 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 146 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:01,428 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 151 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 146 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:01,428 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 151 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 146 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:01,429 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2022-04-27 11:19:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2022-04-27 11:19:01,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:01,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:01,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 146 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-27 11:19:01,430 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 146 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-27 11:19:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:01,431 INFO L93 Difference]: Finished difference Result 168 states and 196 transitions. [2022-04-27 11:19:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2022-04-27 11:19:01,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:01,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:01,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:01,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 146 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2022-04-27 11:19:01,433 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 38 [2022-04-27 11:19:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:01,433 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2022-04-27 11:19:01,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2022-04-27 11:19:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:19:01,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:01,434 INFO L195 NwaCegarLoop]: trace histogram [13, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:01,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-27 11:19:01,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:01,651 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1471527041, now seen corresponding path program 22 times [2022-04-27 11:19:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:01,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144935399] [2022-04-27 11:19:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:01,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:01,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:01,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {16272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16251#true} is VALID [2022-04-27 11:19:01,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {16251#true} assume true; {16251#true} is VALID [2022-04-27 11:19:01,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16251#true} {16251#true} #61#return; {16251#true} is VALID [2022-04-27 11:19:01,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {16251#true} call ULTIMATE.init(); {16272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:01,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {16272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16251#true} is VALID [2022-04-27 11:19:01,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {16251#true} assume true; {16251#true} is VALID [2022-04-27 11:19:01,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16251#true} {16251#true} #61#return; {16251#true} is VALID [2022-04-27 11:19:01,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {16251#true} call #t~ret11 := main(); {16251#true} is VALID [2022-04-27 11:19:01,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {16251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16256#(= main_~y~0 0)} is VALID [2022-04-27 11:19:01,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {16256#(= 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; {16257#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:01,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {16257#(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; {16258#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:01,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {16258#(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; {16259#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:01,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {16259#(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; {16260#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:01,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {16260#(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; {16261#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:01,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {16261#(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; {16262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:01,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {16262#(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; {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:01,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:01,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {16264#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:01,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {16264#(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; {16265#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:01,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {16265#(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; {16266#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:01,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {16266#(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; {16267#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:01,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {16267#(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; {16268#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:19:01,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {16268#(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; {16269#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-27 11:19:01,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {16269#(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; {16270#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-27 11:19:01,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {16270#(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; {16271#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {16271#(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; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {16252#false} assume !(~z~0 % 4294967296 > 0); {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:01,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {16252#false} assume !(~y~0 % 4294967296 > 0); {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L272 TraceCheckUtils]: 37: Hoare triple {16252#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {16252#false} ~cond := #in~cond; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {16252#false} assume 0 == ~cond; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {16252#false} assume !false; {16252#false} is VALID [2022-04-27 11:19:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 48 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 11:19:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:01,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144935399] [2022-04-27 11:19:01,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144935399] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:01,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886983150] [2022-04-27 11:19:01,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:19:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:01,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:01,900 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:19:01,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 11:19:01,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:19:01,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:01,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 11:19:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:01,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:02,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {16251#true} call ULTIMATE.init(); {16251#true} is VALID [2022-04-27 11:19:02,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {16251#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); {16251#true} is VALID [2022-04-27 11:19:02,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {16251#true} assume true; {16251#true} is VALID [2022-04-27 11:19:02,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16251#true} {16251#true} #61#return; {16251#true} is VALID [2022-04-27 11:19:02,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {16251#true} call #t~ret11 := main(); {16251#true} is VALID [2022-04-27 11:19:02,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {16251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16256#(= main_~y~0 0)} is VALID [2022-04-27 11:19:02,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {16256#(= 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; {16257#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:02,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {16257#(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; {16258#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:02,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {16258#(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; {16259#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:02,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {16259#(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; {16260#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:02,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {16260#(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; {16261#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:02,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {16261#(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; {16262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:02,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {16262#(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; {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:02,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:02,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {16263#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {16318#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:02,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {16318#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16322#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:19:02,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {16322#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16326#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-27 11:19:02,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {16326#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16330#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:02,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {16330#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16334#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:02,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {16334#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16338#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-27 11:19:02,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {16338#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ 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; {16342#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:02,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {16342#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16346#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:02,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {16346#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {16252#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; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {16252#false} assume !(~z~0 % 4294967296 > 0); {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {16252#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {16252#false} assume !(~y~0 % 4294967296 > 0); {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L272 TraceCheckUtils]: 37: Hoare triple {16252#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {16252#false} ~cond := #in~cond; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {16252#false} assume 0 == ~cond; {16252#false} is VALID [2022-04-27 11:19:02,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {16252#false} assume !false; {16252#false} is VALID [2022-04-27 11:19:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 48 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 11:19:02,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:02,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {16252#false} assume !false; {16252#false} is VALID [2022-04-27 11:19:02,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {16252#false} assume 0 == ~cond; {16252#false} is VALID [2022-04-27 11:19:02,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {16252#false} ~cond := #in~cond; {16252#false} is VALID [2022-04-27 11:19:02,819 INFO L272 TraceCheckUtils]: 37: Hoare triple {16252#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16252#false} is VALID [2022-04-27 11:19:02,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {16416#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {16252#false} is VALID [2022-04-27 11:19:02,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {16420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16416#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:19:02,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {16424#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:19:02,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {16428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16424#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:19:02,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {16432#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16428#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:19:02,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {16436#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16432#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:02,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {16440#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16436#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:02,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {16440#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:02,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~z~0 % 4294967296 > 0); {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:02,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {16444#(< 0 (mod (+ main_~y~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; {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:02,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {16444#(< 0 (mod (+ main_~y~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; {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:02,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {16444#(< 0 (mod (+ main_~y~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; {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:02,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {16444#(< 0 (mod (+ main_~y~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; {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:02,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {16444#(< 0 (mod (+ main_~y~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; {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:02,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {16466#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16444#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:02,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {16470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {16466#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-27 11:19:02,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {16474#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-27 11:19:02,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {16478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~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; {16474#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-27 11:19:02,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {16482#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (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; {16478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-27 11:19:02,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {16486#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16482#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:19:02,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {16490#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16486#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:19:02,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {16494#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 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; {16490#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-27 11:19:02,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {16251#true} ~z~0 := ~y~0; {16494#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-27 11:19:02,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {16251#true} assume !(~x~0 % 4294967296 > 0); {16251#true} is VALID [2022-04-27 11:19:02,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {16251#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#true} is VALID [2022-04-27 11:19:02,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {16251#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#true} is VALID [2022-04-27 11:19:02,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {16251#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#true} is VALID [2022-04-27 11:19:02,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {16251#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {16251#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {16251#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {16251#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {16251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {16251#true} call #t~ret11 := main(); {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16251#true} {16251#true} #61#return; {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {16251#true} assume true; {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {16251#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); {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {16251#true} call ULTIMATE.init(); {16251#true} is VALID [2022-04-27 11:19:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 48 proven. 56 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 11:19:02,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886983150] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:02,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:02,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-27 11:19:02,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693179736] [2022-04-27 11:19:02,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:02,835 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 2 states have call successors, (4), 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 41 [2022-04-27 11:19:02,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:02,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:02,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:02,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-27 11:19:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-27 11:19:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 11:19:02,881 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:15,808 INFO L93 Difference]: Finished difference Result 300 states and 336 transitions. [2022-04-27 11:19:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-27 11:19:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 2 states have call successors, (4), 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 41 [2022-04-27 11:19:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 128 transitions. [2022-04-27 11:19:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 128 transitions. [2022-04-27 11:19:15,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 128 transitions. [2022-04-27 11:19:16,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:16,265 INFO L225 Difference]: With dead ends: 300 [2022-04-27 11:19:16,265 INFO L226 Difference]: Without dead ends: 272 [2022-04-27 11:19:16,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2803 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1693, Invalid=8813, Unknown=0, NotChecked=0, Total=10506 [2022-04-27 11:19:16,266 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 315 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:16,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 113 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-27 11:19:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-04-27 11:19:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 126. [2022-04-27 11:19:16,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:16,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 272 states. Second operand has 126 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:16,883 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand has 126 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:16,883 INFO L87 Difference]: Start difference. First operand 272 states. Second operand has 126 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:16,887 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2022-04-27 11:19:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 305 transitions. [2022-04-27 11:19:16,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:16,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:16,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 272 states. [2022-04-27 11:19:16,888 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 272 states. [2022-04-27 11:19:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:16,892 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2022-04-27 11:19:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 305 transitions. [2022-04-27 11:19:16,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:16,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:16,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:16,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2022-04-27 11:19:16,894 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 41 [2022-04-27 11:19:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:16,894 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2022-04-27 11:19:16,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2022-04-27 11:19:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:19:16,895 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:16,895 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:16,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 11:19:17,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-27 11:19:17,116 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 23 times [2022-04-27 11:19:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:17,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576816803] [2022-04-27 11:19:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:17,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {17913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17896#true} is VALID [2022-04-27 11:19:17,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {17896#true} assume true; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17896#true} {17896#true} #61#return; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {17913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #61#return; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret11 := main(); {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {17896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:17,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {17896#true} assume !(~x~0 % 4294967296 > 0); {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:17,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:17,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:17,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:17,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-27 11:19:17,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-27 11:19:17,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:17,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:17,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:17,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:17,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:17,369 INFO L272 TraceCheckUtils]: 37: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17911#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:19:17,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {17911#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17912#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:19:17,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {17912#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17897#false} is VALID [2022-04-27 11:19:17,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2022-04-27 11:19:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:19:17,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:17,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576816803] [2022-04-27 11:19:17,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576816803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:17,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287069987] [2022-04-27 11:19:17,371 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:19:17,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:17,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:17,372 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:19:17,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-27 11:19:19,676 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-04-27 11:19:19,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:19,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-27 11:19:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:19,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:19,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {17896#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); {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #61#return; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret11 := main(); {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {17896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:19,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17959#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:19:19,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {17959#(< 0 (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:19,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:19,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:19,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:19,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-27 11:19:19,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-27 11:19:19,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:19,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:19,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:19,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:19,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:19,983 INFO L272 TraceCheckUtils]: 37: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:19:19,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {18029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:19:19,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {18033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17897#false} is VALID [2022-04-27 11:19:19,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2022-04-27 11:19:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:19:19,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:20,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2022-04-27 11:19:20,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {18033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17897#false} is VALID [2022-04-27 11:19:20,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {18029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:19:20,155 INFO L272 TraceCheckUtils]: 37: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:19:20,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:20,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:20,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:20,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:20,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,164 INFO L290 TraceCheckUtils]: 26: Hoare triple {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-27 11:19:20,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 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; {17910#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-27 11:19:20,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {17909#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {17908#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {17907#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-27 11:19:20,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:19:20,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-27 11:19:20,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:20,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {17896#true} assume !(~x~0 % 4294967296 > 0); {17901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-27 11:19:20,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {17896#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {17896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret11 := main(); {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #61#return; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {17896#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); {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2022-04-27 11:19:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:19:20,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287069987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:20,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:20,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 18 [2022-04-27 11:19:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966790396] [2022-04-27 11:19:20,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:20,174 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:19:20,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:20,174 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:20,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:20,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:19:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:19:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:19:20,212 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:21,785 INFO L93 Difference]: Finished difference Result 164 states and 190 transitions. [2022-04-27 11:19:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 11:19:21,785 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:19:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:21,786 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-27 11:19:21,786 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2022-04-27 11:19:21,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2022-04-27 11:19:21,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:21,850 INFO L225 Difference]: With dead ends: 164 [2022-04-27 11:19:21,850 INFO L226 Difference]: Without dead ends: 149 [2022-04-27 11:19:21,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:19:21,850 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:21,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 59 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:19:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-27 11:19:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 136. [2022-04-27 11:19:22,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:22,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 136 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,498 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 136 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,498 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 136 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:22,500 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2022-04-27 11:19:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2022-04-27 11:19:22,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:22,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:22,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-27 11:19:22,500 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 149 states. [2022-04-27 11:19:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:22,501 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2022-04-27 11:19:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2022-04-27 11:19:22,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:22,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:22,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:22,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 131 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2022-04-27 11:19:22,503 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 41 [2022-04-27 11:19:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:22,503 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2022-04-27 11:19:22,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2022-04-27 11:19:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 11:19:22,504 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:22,504 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:22,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-27 11:19:22,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-27 11:19:22,709 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:22,709 INFO L85 PathProgramCache]: Analyzing trace with hash 451640223, now seen corresponding path program 24 times [2022-04-27 11:19:22,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:22,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976689227] [2022-04-27 11:19:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:23,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {19009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18983#true} is VALID [2022-04-27 11:19:23,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {18983#true} assume true; {18983#true} is VALID [2022-04-27 11:19:23,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18983#true} {18983#true} #61#return; {18983#true} is VALID [2022-04-27 11:19:23,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {18983#true} call ULTIMATE.init(); {19009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:23,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {19009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18983#true} is VALID [2022-04-27 11:19:23,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {18983#true} assume true; {18983#true} is VALID [2022-04-27 11:19:23,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18983#true} {18983#true} #61#return; {18983#true} is VALID [2022-04-27 11:19:23,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {18983#true} call #t~ret11 := main(); {18983#true} is VALID [2022-04-27 11:19:23,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {18983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18988#(= main_~y~0 0)} is VALID [2022-04-27 11:19:23,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {18988#(= 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; {18989#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:23,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {18989#(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; {18990#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:23,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {18990#(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; {18991#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:23,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {18991#(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; {18992#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:23,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {18992#(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; {18993#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:23,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {18993#(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; {18994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:23,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {18994#(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; {18995#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:23,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {18995#(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; {18996#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:19:23,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {18996#(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; {18997#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:19:23,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {18997#(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; {18998#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:19:23,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {18998#(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; {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {19000#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:19:23,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {19000#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19001#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:19:23,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {19001#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19002#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:19:23,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {19002#(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; {19003#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:19:23,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {19003#(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; {19004#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:23,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {19004#(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; {19005#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:23,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {19005#(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; {19006#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:23,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {19006#(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; {19007#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {19007#(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; {19008#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {19008#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {18984#false} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {18984#false} assume !(~y~0 % 4294967296 > 0); {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L272 TraceCheckUtils]: 38: Hoare triple {18984#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {18984#false} ~cond := #in~cond; {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {18984#false} assume 0 == ~cond; {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {18984#false} assume !false; {18984#false} is VALID [2022-04-27 11:19:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:19:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:23,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976689227] [2022-04-27 11:19:23,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976689227] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:23,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292034933] [2022-04-27 11:19:23,076 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:19:23,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:23,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:23,080 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:19:23,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-27 11:19:23,235 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 11:19:23,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:19:23,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-27 11:19:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:23,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:23,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {18983#true} call ULTIMATE.init(); {18983#true} is VALID [2022-04-27 11:19:23,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {18983#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); {18983#true} is VALID [2022-04-27 11:19:23,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {18983#true} assume true; {18983#true} is VALID [2022-04-27 11:19:23,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18983#true} {18983#true} #61#return; {18983#true} is VALID [2022-04-27 11:19:23,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {18983#true} call #t~ret11 := main(); {18983#true} is VALID [2022-04-27 11:19:23,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {18983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18988#(= main_~y~0 0)} is VALID [2022-04-27 11:19:23,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {18988#(= 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; {18989#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:23,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {18989#(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; {18990#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:23,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {18990#(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; {18991#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:23,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {18991#(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; {18992#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:23,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {18992#(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; {18993#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:23,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {18993#(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; {18994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:23,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {18994#(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; {18995#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:23,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {18995#(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; {18996#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:19:23,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {18996#(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; {18997#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:19:23,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {18997#(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; {18998#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:19:23,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {18998#(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; {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {18999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {19067#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {19067#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19071#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-27 11:19:23,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {19071#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19075#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {19075#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19079#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {19079#(and (<= main_~y~0 11) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19083#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {19083#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19087#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {19087#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19091#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {19091#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 2)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19095#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {19095#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19099#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:23,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {19099#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {18984#false} is VALID [2022-04-27 11:19:23,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {18984#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {18984#false} assume !(~y~0 % 4294967296 > 0); {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L272 TraceCheckUtils]: 38: Hoare triple {18984#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {18984#false} ~cond := #in~cond; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {18984#false} assume 0 == ~cond; {18984#false} is VALID [2022-04-27 11:19:23,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {18984#false} assume !false; {18984#false} is VALID [2022-04-27 11:19:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:19:23,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:24,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {18984#false} assume !false; {18984#false} is VALID [2022-04-27 11:19:24,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {18984#false} assume 0 == ~cond; {18984#false} is VALID [2022-04-27 11:19:24,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {18984#false} ~cond := #in~cond; {18984#false} is VALID [2022-04-27 11:19:24,397 INFO L272 TraceCheckUtils]: 38: Hoare triple {18984#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18984#false} is VALID [2022-04-27 11:19:24,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {18984#false} assume !(~y~0 % 4294967296 > 0); {18984#false} is VALID [2022-04-27 11:19:24,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {19160#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {18984#false} is VALID [2022-04-27 11:19:24,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {19164#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19160#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:19:24,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {19168#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19164#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:19:24,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {19172#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19168#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-27 11:19:24,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {19176#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19172#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:19:24,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {19180#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19176#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:24,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {19184#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19180#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:24,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {19188#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19184#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:24,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {19192#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {19188#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-27 11:19:24,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {19196#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {19192#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-27 11:19:24,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {19200#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19196#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:19:24,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {19204#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19200#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:19:24,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {19208#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19204#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-27 11:19:24,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {19212#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19208#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:19:24,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {19216#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19212#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:19:24,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {19220#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {19216#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:19:24,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {19224#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {19220#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:19:24,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {19228#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 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; {19224#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-27 11:19:24,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {18983#true} ~z~0 := ~y~0; {19228#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {18983#true} assume !(~x~0 % 4294967296 > 0); {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {18983#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {18983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {18983#true} call #t~ret11 := main(); {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18983#true} {18983#true} #61#return; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {18983#true} assume true; {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {18983#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); {18983#true} is VALID [2022-04-27 11:19:24,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {18983#true} call ULTIMATE.init(); {18983#true} is VALID [2022-04-27 11:19:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-27 11:19:24,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292034933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:24,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:24,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 20] total 51 [2022-04-27 11:19:24,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310641612] [2022-04-27 11:19:24,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 50 states have internal predecessors, (63), 2 states have call successors, (4), 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 42 [2022-04-27 11:19:24,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:24,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 50 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:24,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:24,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-27 11:19:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-27 11:19:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2245, Unknown=0, NotChecked=0, Total=2550 [2022-04-27 11:19:24,472 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 50 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:45,469 INFO L93 Difference]: Finished difference Result 201 states and 241 transitions. [2022-04-27 11:19:45,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-04-27 11:19:45,470 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 50 states have internal predecessors, (63), 2 states have call successors, (4), 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 42 [2022-04-27 11:19:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:19:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 50 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 155 transitions. [2022-04-27 11:19:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 50 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 155 transitions. [2022-04-27 11:19:45,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 155 transitions. [2022-04-27 11:19:45,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:45,966 INFO L225 Difference]: With dead ends: 201 [2022-04-27 11:19:45,966 INFO L226 Difference]: Without dead ends: 168 [2022-04-27 11:19:45,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4970 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1861, Invalid=17599, Unknown=0, NotChecked=0, Total=19460 [2022-04-27 11:19:45,967 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:19:45,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 140 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 11:19:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-27 11:19:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2022-04-27 11:19:46,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:19:46,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 151 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:46,820 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 151 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:46,820 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 156 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 151 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:46,822 INFO L93 Difference]: Finished difference Result 168 states and 193 transitions. [2022-04-27 11:19:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2022-04-27 11:19:46,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:46,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:46,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 151 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-27 11:19:46,822 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 151 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 168 states. [2022-04-27 11:19:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:19:46,824 INFO L93 Difference]: Finished difference Result 168 states and 193 transitions. [2022-04-27 11:19:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2022-04-27 11:19:46,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:19:46,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:19:46,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:19:46,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:19:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.1721854304635762) internal successors, (177), 151 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:46,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2022-04-27 11:19:46,825 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 42 [2022-04-27 11:19:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:19:46,826 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2022-04-27 11:19:46,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 50 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2022-04-27 11:19:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 11:19:46,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:19:46,826 INFO L195 NwaCegarLoop]: trace histogram [12, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:19:46,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-27 11:19:47,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-27 11:19:47,027 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:19:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:19:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1048046865, now seen corresponding path program 25 times [2022-04-27 11:19:47,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:19:47,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885868644] [2022-04-27 11:19:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:19:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:19:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:47,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:19:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:47,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {20432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20404#true} is VALID [2022-04-27 11:19:47,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {20404#true} assume true; {20404#true} is VALID [2022-04-27 11:19:47,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20404#true} {20404#true} #61#return; {20404#true} is VALID [2022-04-27 11:19:47,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {20404#true} call ULTIMATE.init(); {20432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:19:47,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {20432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20404#true} is VALID [2022-04-27 11:19:47,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {20404#true} assume true; {20404#true} is VALID [2022-04-27 11:19:47,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20404#true} {20404#true} #61#return; {20404#true} is VALID [2022-04-27 11:19:47,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {20404#true} call #t~ret11 := main(); {20404#true} is VALID [2022-04-27 11:19:47,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {20404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20409#(= main_~y~0 0)} is VALID [2022-04-27 11:19:47,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {20409#(= 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; {20410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:47,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {20410#(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; {20411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:47,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {20411#(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; {20412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:47,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {20412#(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; {20413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:47,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {20413#(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; {20414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:47,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {20414#(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; {20415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:47,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {20415#(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; {20416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:47,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {20416#(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; {20417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:19:47,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {20417#(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; {20418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:19:47,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {20418#(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; {20419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:19:47,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {20419#(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; {20420#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:47,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {20420#(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; {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:19:47,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:19:47,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {20422#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:19:47,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {20422#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:19:47,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {20423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20424#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:19:47,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {20424#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20425#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:19:47,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {20425#(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; {20426#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:19:47,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {20426#(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; {20427#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:47,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {20427#(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; {20428#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:47,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {20428#(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; {20429#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:47,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {20429#(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; {20430#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:47,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {20430#(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; {20431#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {20431#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {20405#false} assume !(~y~0 % 4294967296 > 0); {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L272 TraceCheckUtils]: 39: Hoare triple {20405#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {20405#false} ~cond := #in~cond; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {20405#false} assume 0 == ~cond; {20405#false} is VALID [2022-04-27 11:19:47,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {20405#false} assume !false; {20405#false} is VALID [2022-04-27 11:19:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:19:47,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:19:47,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885868644] [2022-04-27 11:19:47,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885868644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:19:47,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188920882] [2022-04-27 11:19:47,533 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:19:47,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:19:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:19:47,534 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:19:47,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-27 11:19:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:47,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 11:19:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:19:47,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:19:47,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {20404#true} call ULTIMATE.init(); {20404#true} is VALID [2022-04-27 11:19:47,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {20404#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); {20404#true} is VALID [2022-04-27 11:19:47,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {20404#true} assume true; {20404#true} is VALID [2022-04-27 11:19:47,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20404#true} {20404#true} #61#return; {20404#true} is VALID [2022-04-27 11:19:47,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {20404#true} call #t~ret11 := main(); {20404#true} is VALID [2022-04-27 11:19:47,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {20404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20409#(= main_~y~0 0)} is VALID [2022-04-27 11:19:47,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {20409#(= 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; {20410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 11:19:47,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {20410#(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; {20411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-27 11:19:47,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {20411#(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; {20412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-27 11:19:47,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {20412#(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; {20413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-27 11:19:47,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {20413#(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; {20414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 11:19:47,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {20414#(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; {20415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-27 11:19:47,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {20415#(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; {20416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-27 11:19:47,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {20416#(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; {20417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-27 11:19:47,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {20417#(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; {20418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 11:19:47,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {20418#(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; {20419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-27 11:19:47,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {20419#(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; {20420#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-27 11:19:47,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {20420#(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; {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:19:47,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-27 11:19:47,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {20421#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {20422#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-27 11:19:47,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {20422#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-27 11:19:47,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {20423#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20424#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-27 11:19:47,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {20424#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20425#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-27 11:19:47,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {20425#(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; {20426#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-27 11:19:47,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {20426#(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; {20427#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-27 11:19:47,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {20427#(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; {20428#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-27 11:19:47,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {20428#(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; {20429#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-27 11:19:47,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {20429#(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; {20430#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-27 11:19:47,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {20430#(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; {20520#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {20520#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {20405#false} assume !(~y~0 % 4294967296 > 0); {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L272 TraceCheckUtils]: 39: Hoare triple {20405#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {20405#false} ~cond := #in~cond; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {20405#false} assume 0 == ~cond; {20405#false} is VALID [2022-04-27 11:19:47,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {20405#false} assume !false; {20405#false} is VALID [2022-04-27 11:19:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:19:47,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {20405#false} assume !false; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {20405#false} assume 0 == ~cond; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {20405#false} ~cond := #in~cond; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L272 TraceCheckUtils]: 39: Hoare triple {20405#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {20405#false} assume !(~y~0 % 4294967296 > 0); {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {20405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {20405#false} is VALID [2022-04-27 11:19:48,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {20602#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20405#false} is VALID [2022-04-27 11:19:48,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {20606#(< 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; {20602#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-27 11:19:48,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {20610#(< 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; {20606#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-27 11:19:48,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {20614#(< 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; {20610#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-27 11:19:48,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {20618#(< 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; {20614#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-27 11:19:48,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {20622#(< 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; {20618#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-27 11:19:48,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {20626#(< 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; {20622#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-27 11:19:48,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {20630#(< 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; {20626#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-27 11:19:48,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {20634#(< 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; {20630#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:48,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {20638#(< 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; {20634#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-27 11:19:48,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {20642#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {20638#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-27 11:19:48,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {20642#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20642#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-27 11:19:48,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {20649#(< 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; {20642#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-27 11:19:48,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {20653#(< 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; {20649#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:48,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {20657#(< 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; {20653#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-27 11:19:48,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {20661#(< 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; {20657#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:48,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {20665#(< 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; {20661#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:48,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {20669#(< 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; {20665#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-27 11:19:48,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {20673#(< 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; {20669#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-27 11:19:48,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {20677#(< 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; {20673#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-27 11:19:48,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {20681#(< 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; {20677#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-27 11:19:48,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {20685#(< 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; {20681#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:19:48,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {20689#(< 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; {20685#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-27 11:19:48,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {20693#(< 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; {20689#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-27 11:19:48,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {20404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20693#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-27 11:19:48,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {20404#true} call #t~ret11 := main(); {20404#true} is VALID [2022-04-27 11:19:48,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20404#true} {20404#true} #61#return; {20404#true} is VALID [2022-04-27 11:19:48,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {20404#true} assume true; {20404#true} is VALID [2022-04-27 11:19:48,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {20404#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); {20404#true} is VALID [2022-04-27 11:19:48,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {20404#true} call ULTIMATE.init(); {20404#true} is VALID [2022-04-27 11:19:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:19:48,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188920882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:19:48,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:19:48,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 11:19:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555214406] [2022-04-27 11:19:48,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:19:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.2) internal successors, (60), 49 states have internal predecessors, (60), 2 states have call successors, (4), 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 43 [2022-04-27 11:19:48,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:19:48,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.2) internal successors, (60), 49 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:19:48,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:19:48,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 11:19:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:19:48,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 11:19:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2088, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 11:19:48,694 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 50 states, 50 states have (on average 1.2) internal successors, (60), 49 states have internal predecessors, (60), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:21:20,777 WARN L232 SmtUtils]: Spent 46.17s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:21:27,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:22:36,144 WARN L232 SmtUtils]: Spent 41.81s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:23:31,576 WARN L232 SmtUtils]: Spent 38.01s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)